./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.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 5ace794fa35bd3dd49302fe61957917bbb7565f1b1f34293812fc47531868d51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:46:00,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:46:00,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:46:00,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:46:00,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:46:00,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:46:00,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:46:00,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:46:00,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:46:00,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:46:00,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:46:00,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:46:00,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:46:00,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:46:00,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:46:00,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:00,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:46:00,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:46:00,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:46:00,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:46:00,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:46:00,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:46:00,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:46:00,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 5ace794fa35bd3dd49302fe61957917bbb7565f1b1f34293812fc47531868d51 [2025-03-09 02:46:00,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:46:00,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:46:00,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:46:00,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:46:00,625 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:46:00,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c [2025-03-09 02:46:01,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a2c946a/92548a7be98147328275499a271e849c/FLAG4a7fb2ba5 [2025-03-09 02:46:01,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:46:01,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c [2025-03-09 02:46:01,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a2c946a/92548a7be98147328275499a271e849c/FLAG4a7fb2ba5 [2025-03-09 02:46:02,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a2c946a/92548a7be98147328275499a271e849c [2025-03-09 02:46:02,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:46:02,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:46:02,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:02,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:46:02,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:46:02,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a010f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02, skipping insertion in model container [2025-03-09 02:46:02,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:46:02,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:02,418 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:46:02,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:02,449 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:46:02,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02 WrapperNode [2025-03-09 02:46:02,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:02,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:02,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:46:02,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:46:02,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,477 INFO L138 Inliner]: procedures = 16, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-09 02:46:02,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:02,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:46:02,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:46:02,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:46:02,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,505 INFO L175 MemorySlicer]: Split 29 memory accesses to 6 slices as follows [2, 8, 5, 5, 4, 5]. 28 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, 3, 2, 2, 1, 1]. [2025-03-09 02:46:02,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:46:02,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:46:02,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:46:02,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:46:02,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (1/1) ... [2025-03-09 02:46:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:02,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:02,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:46:02,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:46:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:46:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:46:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:46:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:46:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:46:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_40_0 [2025-03-09 02:46:02,577 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_40_0 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:46:02,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:46:02,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:46:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:46:02,654 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:46:02,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:46:02,834 INFO L1307 $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_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~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; [2025-03-09 02:46:02,857 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-09 02:46:02,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:46:02,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:46:02,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:46:02,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:02 BoogieIcfgContainer [2025-03-09 02:46:02,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:46:02,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:46:02,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:46:02,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:46:02,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:46:02" (1/3) ... [2025-03-09 02:46:02,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb219f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:02, skipping insertion in model container [2025-03-09 02:46:02,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:02" (2/3) ... [2025-03-09 02:46:02,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb219f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:02, skipping insertion in model container [2025-03-09 02:46:02,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:02" (3/3) ... [2025-03-09 02:46:02,873 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_prodbin-ll.c [2025-03-09 02:46:02,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:46:02,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_prodbin-ll.c that has 3 procedures, 59 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-09 02:46:02,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:46:02,936 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;@68d0f5c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:46:02,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 02:46:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 53 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:46:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:46:02,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:02,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:02,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:02,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1493839009, now seen corresponding path program 1 times [2025-03-09 02:46:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:02,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196687241] [2025-03-09 02:46:02,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:02,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:03,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:46:03,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:46:03,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:03,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:03,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:03,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196687241] [2025-03-09 02:46:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196687241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:03,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:46:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891166395] [2025-03-09 02:46:03,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:03,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:46:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:03,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:46:03,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:46:03,099 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 53 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-03-09 02:46:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:03,112 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2025-03-09 02:46:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:46:03,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2025-03-09 02:46:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:03,117 INFO L225 Difference]: With dead ends: 114 [2025-03-09 02:46:03,118 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 02:46:03,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:46:03,123 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:03,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 02:46:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 02:46:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:46:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-03-09 02:46:03,155 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 8 [2025-03-09 02:46:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:03,155 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-03-09 02:46:03,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-03-09 02:46:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-03-09 02:46:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:46:03,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:03,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:46:03,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:03,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1465209858, now seen corresponding path program 1 times [2025-03-09 02:46:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263069223] [2025-03-09 02:46:03,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:03,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:46:03,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:46:03,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:03,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586276070] [2025-03-09 02:46:03,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:03,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:03,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:03,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:03,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:46:03,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:46:03,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:46:03,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:03,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:03,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 02:46:03,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:03,390 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 [2025-03-09 02:46:03,428 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 [2025-03-09 02:46:03,486 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 25 treesize of output 17 [2025-03-09 02:46:03,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:03,498 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 30 treesize of output 18 [2025-03-09 02:46:03,507 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 [2025-03-09 02:46:03,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 02:46:03,587 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 [2025-03-09 02:46:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:03,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263069223] [2025-03-09 02:46:03,603 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586276070] [2025-03-09 02:46:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586276070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:03,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:03,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489321022] [2025-03-09 02:46:03,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:03,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:03,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:03,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:03,605 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 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) [2025-03-09 02:46:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:03,801 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-03-09 02:46:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:03,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 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 8 [2025-03-09 02:46:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:03,806 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:46:03,806 INFO L226 Difference]: Without dead ends: 89 [2025-03-09 02:46:03,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:03,807 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 72 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:03,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 235 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-09 02:46:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2025-03-09 02:46:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:46:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-03-09 02:46:03,819 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 8 [2025-03-09 02:46:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:03,820 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-03-09 02:46:03,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 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) [2025-03-09 02:46:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-03-09 02:46:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:46:03,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:03,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:03,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:04,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_0_to_40_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1823134662, now seen corresponding path program 1 times [2025-03-09 02:46:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038583890] [2025-03-09 02:46:04,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:04,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:46:04,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:46:04,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:04,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:04,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789453782] [2025-03-09 02:46:04,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:04,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:04,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:04,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:04,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:46:04,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:46:04,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:46:04,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:04,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:04,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 02:46:04,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:04,161 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 [2025-03-09 02:46:04,170 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 [2025-03-09 02:46:04,206 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 30 treesize of output 18 [2025-03-09 02:46:04,216 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 [2025-03-09 02:46:04,220 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 23 treesize of output 15 [2025-03-09 02:46:04,224 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 [2025-03-09 02:46:04,302 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 [2025-03-09 02:46:04,306 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 [2025-03-09 02:46:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:04,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038583890] [2025-03-09 02:46:04,327 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789453782] [2025-03-09 02:46:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789453782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442231428] [2025-03-09 02:46:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:04,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:04,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:04,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:04,329 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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) [2025-03-09 02:46:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:04,489 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-03-09 02:46:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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 9 [2025-03-09 02:46:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:04,490 INFO L225 Difference]: With dead ends: 89 [2025-03-09 02:46:04,490 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 02:46:04,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:04,490 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:04,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 239 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 02:46:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2025-03-09 02:46:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:46:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-03-09 02:46:04,500 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 9 [2025-03-09 02:46:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-03-09 02:46:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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) [2025-03-09 02:46:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-03-09 02:46:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:46:04,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:04,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:04,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:04,705 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,SelfDestructingSolverStorable2 [2025-03-09 02:46:04,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_0_to_40_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:04,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 682599676, now seen corresponding path program 1 times [2025-03-09 02:46:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109699516] [2025-03-09 02:46:04,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:04,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:46:04,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:46:04,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:04,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109699516] [2025-03-09 02:46:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109699516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584968946] [2025-03-09 02:46:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:04,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:04,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:04,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:04,926 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2025-03-09 02:46:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:05,033 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-03-09 02:46:05,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:05,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 10 [2025-03-09 02:46:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:05,035 INFO L225 Difference]: With dead ends: 102 [2025-03-09 02:46:05,035 INFO L226 Difference]: Without dead ends: 101 [2025-03-09 02:46:05,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:05,036 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 76 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:05,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-09 02:46:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2025-03-09 02:46:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 77 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-09 02:46:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-03-09 02:46:05,046 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 10 [2025-03-09 02:46:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:05,047 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-03-09 02:46:05,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2025-03-09 02:46:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-03-09 02:46:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 02:46:05,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:05,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:05,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:46:05,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_0_to_40_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:05,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash -314246524, now seen corresponding path program 1 times [2025-03-09 02:46:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53814616] [2025-03-09 02:46:05,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:05,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 02:46:05,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 02:46:05,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:05,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:05,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:05,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53814616] [2025-03-09 02:46:05,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53814616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:05,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:05,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:05,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225562753] [2025-03-09 02:46:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:05,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:05,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:05,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:05,244 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-09 02:46:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:05,405 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-03-09 02:46:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:05,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2025-03-09 02:46:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:05,406 INFO L225 Difference]: With dead ends: 101 [2025-03-09 02:46:05,406 INFO L226 Difference]: Without dead ends: 100 [2025-03-09 02:46:05,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:05,408 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:05,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 250 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-09 02:46:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-03-09 02:46:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5) internal successors, (90), 77 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-09 02:46:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-03-09 02:46:05,421 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 11 [2025-03-09 02:46:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:05,421 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-03-09 02:46:05,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-09 02:46:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-03-09 02:46:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:46:05,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:05,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:05,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:46:05,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_0_to_40_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:05,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1151707654, now seen corresponding path program 1 times [2025-03-09 02:46:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396447395] [2025-03-09 02:46:05,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:05,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:46:05,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:46:05,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964295427] [2025-03-09 02:46:05,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:05,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:05,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:05,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:05,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:46:05,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:46:05,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:46:05,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:05,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:05,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 02:46:05,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:05,560 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 [2025-03-09 02:46:05,564 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 [2025-03-09 02:46:05,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 02:46:05,668 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 [2025-03-09 02:46:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:05,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396447395] [2025-03-09 02:46:05,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964295427] [2025-03-09 02:46:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964295427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:05,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:05,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600781526] [2025-03-09 02:46:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:05,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:05,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:05,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:05,683 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2025-03-09 02:46:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:05,791 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2025-03-09 02:46:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:05,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 12 [2025-03-09 02:46:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:05,792 INFO L225 Difference]: With dead ends: 87 [2025-03-09 02:46:05,792 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 02:46:05,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:05,793 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 69 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:05,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 02:46:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-09 02:46:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.45) internal successors, (87), 76 states have internal predecessors, (87), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-09 02:46:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2025-03-09 02:46:05,807 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 12 [2025-03-09 02:46:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:05,807 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2025-03-09 02:46:05,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2025-03-09 02:46:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2025-03-09 02:46:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:46:05,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:05,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:05,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:06,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:06,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_0_to_40_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:06,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1343198910, now seen corresponding path program 1 times [2025-03-09 02:46:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:06,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351739764] [2025-03-09 02:46:06,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:06,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:46:06,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:46:06,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:06,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354600173] [2025-03-09 02:46:06,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:06,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:06,032 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) [2025-03-09 02:46:06,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:46:06,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:46:06,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:46:06,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:06,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:06,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-09 02:46:06,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:06,110 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 [2025-03-09 02:46:06,111 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 [2025-03-09 02:46:06,114 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 11 [2025-03-09 02:46:06,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 15 treesize of output 11 [2025-03-09 02:46:06,160 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 19 treesize of output 11 [2025-03-09 02:46:06,165 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 19 treesize of output 11 [2025-03-09 02:46:06,241 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 21 treesize of output 13 [2025-03-09 02:46:06,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 02:46:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:06,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:06,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351739764] [2025-03-09 02:46:06,337 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354600173] [2025-03-09 02:46:06,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354600173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:06,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:06,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:06,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148033511] [2025-03-09 02:46:06,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:06,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:06,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:06,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:06,338 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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) [2025-03-09 02:46:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:06,725 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2025-03-09 02:46:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:46:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 13 [2025-03-09 02:46:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:06,727 INFO L225 Difference]: With dead ends: 119 [2025-03-09 02:46:06,727 INFO L226 Difference]: Without dead ends: 118 [2025-03-09 02:46:06,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:06,727 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 87 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:06,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 238 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-09 02:46:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2025-03-09 02:46:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.52) internal successors, (114), 93 states have internal predecessors, (114), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-09 02:46:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2025-03-09 02:46:06,739 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 13 [2025-03-09 02:46:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:06,739 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-03-09 02:46:06,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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) [2025-03-09 02:46:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2025-03-09 02:46:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:46:06,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:06,740 INFO L218 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] [2025-03-09 02:46:06,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:46:06,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:06,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_0_to_40_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:06,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 53512515, now seen corresponding path program 1 times [2025-03-09 02:46:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:06,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739074041] [2025-03-09 02:46:06,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:06,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:46:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:46:06,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:06,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:07,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:07,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739074041] [2025-03-09 02:46:07,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739074041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:07,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206573272] [2025-03-09 02:46:07,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:07,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:07,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:07,251 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2025-03-09 02:46:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:07,343 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2025-03-09 02:46:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:07,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 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 [2025-03-09 02:46:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:07,345 INFO L225 Difference]: With dead ends: 110 [2025-03-09 02:46:07,345 INFO L226 Difference]: Without dead ends: 109 [2025-03-09 02:46:07,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:07,345 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:07,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-09 02:46:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2025-03-09 02:46:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 93 states have internal predecessors, (113), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-09 02:46:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2025-03-09 02:46:07,355 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 22 [2025-03-09 02:46:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:07,355 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2025-03-09 02:46:07,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2025-03-09 02:46:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2025-03-09 02:46:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:46:07,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:07,356 INFO L218 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] [2025-03-09 02:46:07,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:46:07,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_0_to_40_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:07,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1658887949, now seen corresponding path program 1 times [2025-03-09 02:46:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:07,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890347799] [2025-03-09 02:46:07,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:07,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:07,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:46:07,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:46:07,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:07,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:07,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:07,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890347799] [2025-03-09 02:46:07,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890347799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:07,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:07,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:07,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36510311] [2025-03-09 02:46:07,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:07,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:07,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:07,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:07,650 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 02:46:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:07,735 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2025-03-09 02:46:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:07,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2025-03-09 02:46:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:07,737 INFO L225 Difference]: With dead ends: 109 [2025-03-09 02:46:07,737 INFO L226 Difference]: Without dead ends: 108 [2025-03-09 02:46:07,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:07,738 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:07,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 245 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-09 02:46:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2025-03-09 02:46:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 93 states have internal predecessors, (112), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-09 02:46:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2025-03-09 02:46:07,749 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 23 [2025-03-09 02:46:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:07,749 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2025-03-09 02:46:07,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 02:46:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2025-03-09 02:46:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:46:07,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:07,750 INFO L218 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] [2025-03-09 02:46:07,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:46:07,750 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_0_to_40_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:07,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:07,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1658888686, now seen corresponding path program 1 times [2025-03-09 02:46:07,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:07,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265086434] [2025-03-09 02:46:07,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:07,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:46:07,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:46:07,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:07,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265086434] [2025-03-09 02:46:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265086434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:07,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831302135] [2025-03-09 02:46:07,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:07,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:07,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:07,926 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 02:46:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:07,989 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2025-03-09 02:46:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:07,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2025-03-09 02:46:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:07,990 INFO L225 Difference]: With dead ends: 114 [2025-03-09 02:46:07,991 INFO L226 Difference]: Without dead ends: 113 [2025-03-09 02:46:07,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:07,992 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:07,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 248 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-09 02:46:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2025-03-09 02:46:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 93 states have internal predecessors, (110), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-09 02:46:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2025-03-09 02:46:08,000 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 23 [2025-03-09 02:46:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,000 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2025-03-09 02:46:08,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 02:46:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2025-03-09 02:46:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:46:08,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,002 INFO L218 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] [2025-03-09 02:46:08,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:46:08,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:08,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash -115188000, now seen corresponding path program 1 times [2025-03-09 02:46:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443089806] [2025-03-09 02:46:08,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:46:08,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:46:08,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:08,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443089806] [2025-03-09 02:46:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443089806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:08,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:46:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60747051] [2025-03-09 02:46:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:08,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:08,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:08,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:08,161 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:08,255 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2025-03-09 02:46:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:08,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-09 02:46:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:08,256 INFO L225 Difference]: With dead ends: 121 [2025-03-09 02:46:08,256 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 02:46:08,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:46:08,257 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:08,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 230 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 02:46:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2025-03-09 02:46:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 93 states have internal predecessors, (110), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2025-03-09 02:46:08,266 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 24 [2025-03-09 02:46:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,266 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2025-03-09 02:46:08,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2025-03-09 02:46:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:46:08,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,267 INFO L218 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] [2025-03-09 02:46:08,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:46:08,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_0_to_40_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:08,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash -114081151, now seen corresponding path program 1 times [2025-03-09 02:46:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106079151] [2025-03-09 02:46:08,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:46:08,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:46:08,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106079151] [2025-03-09 02:46:08,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106079151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:08,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:08,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731150787] [2025-03-09 02:46:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:08,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:08,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:08,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:08,402 INFO L87 Difference]: Start difference. First operand 105 states and 132 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) [2025-03-09 02:46:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:08,479 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-03-09 02:46:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:08,479 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 [2025-03-09 02:46:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:08,480 INFO L225 Difference]: With dead ends: 110 [2025-03-09 02:46:08,480 INFO L226 Difference]: Without dead ends: 109 [2025-03-09 02:46:08,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:08,481 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:08,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 234 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-09 02:46:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-03-09 02:46:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 93 states have internal predecessors, (109), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2025-03-09 02:46:08,493 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 24 [2025-03-09 02:46:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,493 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2025-03-09 02:46:08,493 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) [2025-03-09 02:46:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2025-03-09 02:46:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:46:08,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,494 INFO L218 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] [2025-03-09 02:46:08,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:46:08,494 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_0_to_40_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:08,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -114058311, now seen corresponding path program 1 times [2025-03-09 02:46:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845062151] [2025-03-09 02:46:08,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:46:08,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:46:08,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845062151] [2025-03-09 02:46:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845062151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982318277] [2025-03-09 02:46:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:08,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:08,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:08,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:08,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:08,626 INFO L87 Difference]: Start difference. First operand 105 states and 131 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) [2025-03-09 02:46:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:08,688 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2025-03-09 02:46:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:08,689 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 [2025-03-09 02:46:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:08,689 INFO L225 Difference]: With dead ends: 107 [2025-03-09 02:46:08,689 INFO L226 Difference]: Without dead ends: 106 [2025-03-09 02:46:08,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:08,690 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:08,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 255 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-09 02:46:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-09 02:46:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 93 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2025-03-09 02:46:08,696 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 24 [2025-03-09 02:46:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,696 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2025-03-09 02:46:08,696 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) [2025-03-09 02:46:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2025-03-09 02:46:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:46:08,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,697 INFO L218 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] [2025-03-09 02:46:08,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:46:08,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_0_to_40_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:08,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash 758451595, now seen corresponding path program 1 times [2025-03-09 02:46:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257274878] [2025-03-09 02:46:08,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:46:08,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:46:08,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:08,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:08,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257274878] [2025-03-09 02:46:08,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257274878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236340100] [2025-03-09 02:46:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:08,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:08,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:08,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:08,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:08,831 INFO L87 Difference]: Start difference. First operand 105 states and 129 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) [2025-03-09 02:46:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:08,897 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2025-03-09 02:46:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:08,898 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 [2025-03-09 02:46:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:08,898 INFO L225 Difference]: With dead ends: 108 [2025-03-09 02:46:08,898 INFO L226 Difference]: Without dead ends: 107 [2025-03-09 02:46:08,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:08,899 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:08,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 237 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-09 02:46:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-09 02:46:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.394736842105263) internal successors, (106), 93 states have internal predecessors, (106), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2025-03-09 02:46:08,906 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 25 [2025-03-09 02:46:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,906 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2025-03-09 02:46:08,906 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) [2025-03-09 02:46:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2025-03-09 02:46:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:46:08,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,907 INFO L218 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] [2025-03-09 02:46:08,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:46:08,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:08,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash 759159628, now seen corresponding path program 1 times [2025-03-09 02:46:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852285510] [2025-03-09 02:46:08,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:46:08,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:46:08,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852285510] [2025-03-09 02:46:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852285510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190428314] [2025-03-09 02:46:09,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:09,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:09,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:09,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:09,051 INFO L87 Difference]: Start difference. First operand 105 states and 128 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) [2025-03-09 02:46:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:09,147 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2025-03-09 02:46:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:09,148 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 [2025-03-09 02:46:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:09,149 INFO L225 Difference]: With dead ends: 122 [2025-03-09 02:46:09,149 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 02:46:09,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:09,149 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 52 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:09,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 224 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 02:46:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2025-03-09 02:46:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2025-03-09 02:46:09,159 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 25 [2025-03-09 02:46:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:09,159 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2025-03-09 02:46:09,159 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) [2025-03-09 02:46:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2025-03-09 02:46:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:46:09,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:09,160 INFO L218 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, 1] [2025-03-09 02:46:09,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:46:09,161 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:09,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2059111959, now seen corresponding path program 1 times [2025-03-09 02:46:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:09,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736213441] [2025-03-09 02:46:09,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:09,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:46:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:46:09,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:09,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736213441] [2025-03-09 02:46:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736213441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:09,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:09,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468576306] [2025-03-09 02:46:09,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:09,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:09,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:09,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:09,311 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-09 02:46:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:09,399 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2025-03-09 02:46:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 26 [2025-03-09 02:46:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:09,401 INFO L225 Difference]: With dead ends: 121 [2025-03-09 02:46:09,401 INFO L226 Difference]: Without dead ends: 120 [2025-03-09 02:46:09,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:09,402 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 50 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:09,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 227 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-09 02:46:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2025-03-09 02:46:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 93 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-03-09 02:46:09,410 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 26 [2025-03-09 02:46:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:09,410 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-03-09 02:46:09,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-09 02:46:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-03-09 02:46:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:46:09,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:09,411 INFO L218 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, 1, 1, 1, 1] [2025-03-09 02:46:09,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:46:09,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:09,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1233349319, now seen corresponding path program 1 times [2025-03-09 02:46:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578373420] [2025-03-09 02:46:09,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:09,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:46:09,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:46:09,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:09,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578373420] [2025-03-09 02:46:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578373420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:09,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:09,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096629142] [2025-03-09 02:46:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:09,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:09,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:09,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:09,496 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:09,535 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2025-03-09 02:46:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:46:09,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 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 29 [2025-03-09 02:46:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:09,537 INFO L225 Difference]: With dead ends: 115 [2025-03-09 02:46:09,537 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 02:46:09,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:09,537 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:09,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 200 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 02:46:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2025-03-09 02:46:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.3375) internal successors, (107), 97 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2025-03-09 02:46:09,548 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 29 [2025-03-09 02:46:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2025-03-09 02:46:09,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2025-03-09 02:46:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:09,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:09,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:09,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:46:09,550 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2006497820, now seen corresponding path program 1 times [2025-03-09 02:46:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853690194] [2025-03-09 02:46:09,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:09,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:09,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:09,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391486890] [2025-03-09 02:46:09,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:09,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:09,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:09,582 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) [2025-03-09 02:46:09,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:46:09,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:09,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:09,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:09,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:09,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-09 02:46:09,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:09,698 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 [2025-03-09 02:46:09,703 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 [2025-03-09 02:46:09,734 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 25 treesize of output 17 [2025-03-09 02:46:09,737 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 [2025-03-09 02:46:09,741 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 30 treesize of output 18 [2025-03-09 02:46:09,747 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 [2025-03-09 02:46:10,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-09 02:46:10,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-09 02:46:10,221 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 [2025-03-09 02:46:10,226 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 28 treesize of output 16 [2025-03-09 02:46:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:10,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:11,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853690194] [2025-03-09 02:46:11,164 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:11,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391486890] [2025-03-09 02:46:11,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391486890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:11,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-09 02:46:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020596147] [2025-03-09 02:46:11,164 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:11,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 02:46:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:11,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 02:46:11,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:46:11,165 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:15,444 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] [2025-03-09 02:46:19,473 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] [2025-03-09 02:46:23,503 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] [2025-03-09 02:46:27,523 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] [2025-03-09 02:46:31,629 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] [2025-03-09 02:46:35,764 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] [2025-03-09 02:46:39,791 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] [2025-03-09 02:46:43,821 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] [2025-03-09 02:46:47,829 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] [2025-03-09 02:46:51,839 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] [2025-03-09 02:46:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:51,843 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2025-03-09 02:46:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:46:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 02:46:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:51,845 INFO L225 Difference]: With dead ends: 145 [2025-03-09 02:46:51,845 INFO L226 Difference]: Without dead ends: 144 [2025-03-09 02:46:51,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:46:51,845 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 83 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 7 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:51,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 504 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 516 Invalid, 10 Unknown, 0 Unchecked, 40.4s Time] [2025-03-09 02:46:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-09 02:46:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2025-03-09 02:46:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 111 states have internal predecessors, (124), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (15), 8 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-09 02:46:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2025-03-09 02:46:51,858 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 30 [2025-03-09 02:46:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:51,858 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2025-03-09 02:46:51,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2025-03-09 02:46:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:51,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:51,859 INFO L218 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, 1, 1, 1, 1, 1] [2025-03-09 02:46:51,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:46:52,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:46:52,060 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:52,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash -420876804, now seen corresponding path program 1 times [2025-03-09 02:46:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:52,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665724228] [2025-03-09 02:46:52,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:52,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:52,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:52,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:52,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:52,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665724228] [2025-03-09 02:46:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665724228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:52,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104267163] [2025-03-09 02:46:52,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:52,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:52,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:52,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:52,153 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:52,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:52,189 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2025-03-09 02:46:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:46:52,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 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 30 [2025-03-09 02:46:52,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:52,190 INFO L225 Difference]: With dead ends: 130 [2025-03-09 02:46:52,190 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 02:46:52,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:52,191 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:52,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 151 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 02:46:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-09 02:46:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 95 states have (on average 1.305263157894737) internal successors, (124), 112 states have internal predecessors, (124), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (15), 8 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-09 02:46:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2025-03-09 02:46:52,203 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 30 [2025-03-09 02:46:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:52,204 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2025-03-09 02:46:52,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2025-03-09 02:46:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:46:52,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:52,205 INFO L218 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] [2025-03-09 02:46:52,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:46:52,205 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_0_to_40_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:46:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2071890280, now seen corresponding path program 1 times [2025-03-09 02:46:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:52,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221343228] [2025-03-09 02:46:52,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:52,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:46:52,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:46:52,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:52,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:52,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451429888] [2025-03-09 02:46:52,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:52,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:52,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:52,231 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) [2025-03-09 02:46:52,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:46:52,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:46:52,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:46:52,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:52,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-09 02:46:52,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:52,342 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 [2025-03-09 02:46:52,348 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 [2025-03-09 02:46:52,375 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 30 treesize of output 18 [2025-03-09 02:46:52,381 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 [2025-03-09 02:46:52,383 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 23 treesize of output 15 [2025-03-09 02:46:52,386 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 [2025-03-09 02:46:52,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-09 02:46:52,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-09 02:46:52,818 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 [2025-03-09 02:46:52,823 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 30 treesize of output 18 [2025-03-09 02:46:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:52,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:53,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221343228] [2025-03-09 02:46:53,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451429888] [2025-03-09 02:46:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451429888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:53,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-09 02:46:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605722223] [2025-03-09 02:46:53,791 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:53,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 02:46:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:53,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 02:46:53,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:46:53,791 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 17 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:58,081 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] [2025-03-09 02:47:02,099 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] [2025-03-09 02:47:06,121 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] [2025-03-09 02:47:10,134 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] [2025-03-09 02:47:14,219 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] [2025-03-09 02:47:18,329 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] [2025-03-09 02:47:22,357 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] [2025-03-09 02:47:26,388 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] [2025-03-09 02:47:30,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:34,408 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] [2025-03-09 02:47:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:34,414 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2025-03-09 02:47:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:47:34,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-09 02:47:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:34,415 INFO L225 Difference]: With dead ends: 145 [2025-03-09 02:47:34,415 INFO L226 Difference]: Without dead ends: 144 [2025-03-09 02:47:34,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:47:34,415 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 80 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 7 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:34,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 458 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 455 Invalid, 10 Unknown, 0 Unchecked, 40.4s Time] [2025-03-09 02:47:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-09 02:47:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2025-03-09 02:47:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 112 states have internal predecessors, (123), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (15), 8 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-09 02:47:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2025-03-09 02:47:34,429 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 31 [2025-03-09 02:47:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:34,430 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2025-03-09 02:47:34,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:47:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2025-03-09 02:47:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:47:34,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:34,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:34,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:47:34,635 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 [2025-03-09 02:47:34,635 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:47:34,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1679466369, now seen corresponding path program 1 times [2025-03-09 02:47:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439222240] [2025-03-09 02:47:34,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:34,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:34,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:47:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:47:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599895363] [2025-03-09 02:47:34,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:34,662 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) [2025-03-09 02:47:34,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:47:34,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:47:34,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:47:34,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:34,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:34,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-09 02:47:34,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:34,772 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 [2025-03-09 02:47:34,784 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 [2025-03-09 02:47:34,809 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 25 treesize of output 17 [2025-03-09 02:47:34,812 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 [2025-03-09 02:47:34,815 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 30 treesize of output 18 [2025-03-09 02:47:34,821 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 [2025-03-09 02:47:35,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2025-03-09 02:47:35,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-09 02:47:35,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-09 02:47:35,243 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 [2025-03-09 02:47:35,246 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 28 treesize of output 16 [2025-03-09 02:47:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:47:35,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439222240] [2025-03-09 02:47:36,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599895363] [2025-03-09 02:47:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599895363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:36,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:36,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-09 02:47:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520869447] [2025-03-09 02:47:36,437 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:47:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 02:47:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:36,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 02:47:36,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:47:36,438 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand has 17 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:47:40,714 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]