./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-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_prod4br-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 96f1211cbeeae798f0ae4041c6e80d5023e7b1c38257b583d7afbb4e6848597b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:45:55,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:45:55,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:45:55,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:45:55,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:45:55,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:45:55,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:45:55,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:45:55,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:45:55,797 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:45:55,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:45:55,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:45:55,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:45:55,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:45:55,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:45:55,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:45:55,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:45:55,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:45:55,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:45:55,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:45:55,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:45:55,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:45:55,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:45:55,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:45:55,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:45:55,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:45:55,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:45:55,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:45:55,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:45:55,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:45:55,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:45:55,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:45:55,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:45:55,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:45:55,801 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 -> 96f1211cbeeae798f0ae4041c6e80d5023e7b1c38257b583d7afbb4e6848597b [2025-03-09 02:45:56,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:45:56,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:45:56,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:45:56,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:45:56,034 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:45:56,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c [2025-03-09 02:45:57,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54de3735/d695c1c356a94fed8e628e6b5fbc5ca6/FLAGe0790b936 [2025-03-09 02:45:57,334 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:45:57,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c [2025-03-09 02:45:57,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54de3735/d695c1c356a94fed8e628e6b5fbc5ca6/FLAGe0790b936 [2025-03-09 02:45:57,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54de3735/d695c1c356a94fed8e628e6b5fbc5ca6 [2025-03-09 02:45:57,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:45:57,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:45:57,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:45:57,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:45:57,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:45:57,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4479722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57, skipping insertion in model container [2025-03-09 02:45:57,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:45:57,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:45:57,832 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:45:57,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:45:57,867 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:45:57,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57 WrapperNode [2025-03-09 02:45:57,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:45:57,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:45:57,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:45:57,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:45:57,874 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:45:57" (1/1) ... [2025-03-09 02:45:57,880 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:45:57" (1/1) ... [2025-03-09 02:45:57,895 INFO L138 Inliner]: procedures = 16, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2025-03-09 02:45:57,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:45:57,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:45:57,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:45:57,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:45:57,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,927 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 7, 5, 4, 15, 9, 15]. 26 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 16 writes are split as follows [0, 2, 1, 1, 4, 4, 4]. [2025-03-09 02:45:57,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:45:57,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:45:57,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:45:57,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:45:57,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (1/1) ... [2025-03-09 02:45:57,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:45:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:57,972 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:45:57,974 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:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:45:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:45:57,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:45:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:45:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:45:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:45:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:45:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:45:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:45:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 02:45:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_51_0 [2025-03-09 02:45:57,992 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_51_0 [2025-03-09 02:45:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:45:57,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:45:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:45:58,066 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:45:58,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:45:58,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: 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_~#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_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset; [2025-03-09 02:45:58,362 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-09 02:45:58,363 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:45:58,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:45:58,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:45:58,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:45:58 BoogieIcfgContainer [2025-03-09 02:45:58,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:45:58,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:45:58,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:45:58,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:45:58,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:45:57" (1/3) ... [2025-03-09 02:45:58,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2765d85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:45:58, skipping insertion in model container [2025-03-09 02:45:58,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:57" (2/3) ... [2025-03-09 02:45:58,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2765d85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:45:58, skipping insertion in model container [2025-03-09 02:45:58,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:45:58" (3/3) ... [2025-03-09 02:45:58,383 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_prod4br-ll.c [2025-03-09 02:45:58,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:45:58,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_prod4br-ll.c that has 3 procedures, 118 locations, 1 initial locations, 0 loop locations, and 42 error locations. [2025-03-09 02:45:58,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:45:58,449 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;@3cd8e427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:45:58,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-09 02:45:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 111 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:45:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:45:58,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:58,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:58,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_0_to_51_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:45:58,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1537166290, now seen corresponding path program 1 times [2025-03-09 02:45:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:58,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673577416] [2025-03-09 02:45:58,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:58,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:45:58,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:45:58,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:58,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:58,611 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:45:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673577416] [2025-03-09 02:45:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673577416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:58,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:58,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:45:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022517448] [2025-03-09 02:45:58,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:58,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:45:58,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:58,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:45:58,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:45:58,632 INFO L87 Difference]: Start difference. First operand has 118 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 111 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:45:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:58,661 INFO L93 Difference]: Finished difference Result 232 states and 262 transitions. [2025-03-09 02:45:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:45:58,662 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:45:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:58,669 INFO L225 Difference]: With dead ends: 232 [2025-03-09 02:45:58,669 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 02:45:58,672 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:45:58,675 INFO L435 NwaCegarLoop]: 127 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, 127 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:45:58,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:45:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 02:45:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-09 02:45:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 105 states have internal predecessors, (112), 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:45:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2025-03-09 02:45:58,711 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 8 [2025-03-09 02:45:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:58,712 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2025-03-09 02:45:58,712 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:45:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2025-03-09 02:45:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:45:58,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:58,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:58,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:45:58,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_0_to_51_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:45:58,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1565795441, now seen corresponding path program 1 times [2025-03-09 02:45:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265882465] [2025-03-09 02:45:58,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:58,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:45:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:45:58,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:58,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:58,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49173285] [2025-03-09 02:45:58,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:58,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:58,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:58,761 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:45:58,762 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:45:58,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:45:58,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:45:58,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:58,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:58,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 02:45:58,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:58,937 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:45:58,961 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:45:59,016 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:45:59,023 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:45:59,027 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:45:59,035 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:45:59,111 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:45:59,117 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:45:59,130 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:45:59,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265882465] [2025-03-09 02:45:59,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49173285] [2025-03-09 02:45:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49173285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:59,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:45:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665892031] [2025-03-09 02:45:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:45:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:59,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:45:59,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:45:59,133 INFO L87 Difference]: Start difference. First operand 111 states and 120 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:45:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:59,404 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2025-03-09 02:45:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:45:59,404 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:45:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:59,405 INFO L225 Difference]: With dead ends: 164 [2025-03-09 02:45:59,405 INFO L226 Difference]: Without dead ends: 163 [2025-03-09 02:45:59,405 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:45:59,406 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 109 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:59,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 599 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:45:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-09 02:45:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 127. [2025-03-09 02:45:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7532467532467533) internal successors, (135), 119 states have internal predecessors, (135), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:45:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2025-03-09 02:45:59,415 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 8 [2025-03-09 02:45:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:59,415 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2025-03-09 02:45:59,415 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:45:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2025-03-09 02:45:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:45:59,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:59,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:59,423 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:45:59,616 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:45:59,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_0_to_51_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:45:59,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1295018501, now seen corresponding path program 1 times [2025-03-09 02:45:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416381392] [2025-03-09 02:45:59,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:59,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:45:59,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:45:59,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:59,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988937009] [2025-03-09 02:45:59,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:59,659 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:45:59,660 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:45:59,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:45:59,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:45:59,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:59,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:59,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 02:45:59,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:59,757 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:45:59,763 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:45:59,795 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:45:59,800 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:45:59,804 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:45:59,808 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:45:59,887 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:45:59,891 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:45:59,907 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:45:59,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416381392] [2025-03-09 02:45:59,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988937009] [2025-03-09 02:45:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988937009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:45:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653170259] [2025-03-09 02:45:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:59,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:45:59,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:59,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:45:59,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:45:59,909 INFO L87 Difference]: Start difference. First operand 127 states and 146 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:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:00,144 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2025-03-09 02:46:00,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:00,145 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:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:00,146 INFO L225 Difference]: With dead ends: 163 [2025-03-09 02:46:00,146 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 02:46:00,146 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:00,146 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 106 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:00,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 603 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 02:46:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2025-03-09 02:46:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 119 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2025-03-09 02:46:00,157 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 9 [2025-03-09 02:46:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:00,157 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2025-03-09 02:46:00,157 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:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2025-03-09 02:46:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:46:00,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:00,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:00,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:46:00,362 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:00,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_0_to_51_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:00,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1490867951, now seen corresponding path program 1 times [2025-03-09 02:46:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:00,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035531477] [2025-03-09 02:46:00,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:00,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:46:00,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:46:00,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:00,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959844487] [2025-03-09 02:46:00,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:00,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:00,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:00,395 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:00,397 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:00,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:46:00,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:46:00,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:00,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:00,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-09 02:46:00,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:00,488 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:00,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:00,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:00,534 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:00,539 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:00,542 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:00,549 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:00,604 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:00,609 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:00,649 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:00,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035531477] [2025-03-09 02:46:00,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959844487] [2025-03-09 02:46:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959844487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:00,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:00,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:00,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752034408] [2025-03-09 02:46:00,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:00,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:00,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:00,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:00,651 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:00,962 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2025-03-09 02:46:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:46:00,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:00,963 INFO L225 Difference]: With dead ends: 162 [2025-03-09 02:46:00,963 INFO L226 Difference]: Without dead ends: 161 [2025-03-09 02:46:00,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:00,963 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 112 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:00,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 677 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-09 02:46:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 127. [2025-03-09 02:46:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 119 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2025-03-09 02:46:00,970 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 10 [2025-03-09 02:46:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:00,970 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2025-03-09 02:46:00,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2025-03-09 02:46:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 02:46:00,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:00,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:00,976 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:01,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:01,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_0_to_51_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:01,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1027733693, now seen corresponding path program 1 times [2025-03-09 02:46:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:01,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413346825] [2025-03-09 02:46:01,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:01,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 02:46:01,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 02:46:01,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:01,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:01,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116296174] [2025-03-09 02:46:01,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:01,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:01,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:01,200 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:01,201 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:01,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 02:46:01,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 02:46:01,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:01,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-09 02:46:01,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:01,296 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:01,298 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:01,329 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:01,335 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:01,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:01,341 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:01,347 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:01,405 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:01,410 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:01,456 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:01,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413346825] [2025-03-09 02:46:01,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116296174] [2025-03-09 02:46:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116296174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:01,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:01,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992301768] [2025-03-09 02:46:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:01,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:01,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:01,457 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:01,741 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2025-03-09 02:46:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:46:01,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:01,742 INFO L225 Difference]: With dead ends: 161 [2025-03-09 02:46:01,742 INFO L226 Difference]: Without dead ends: 160 [2025-03-09 02:46:01,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:01,743 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 109 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:01,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 681 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-09 02:46:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 127. [2025-03-09 02:46:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 119 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2025-03-09 02:46:01,754 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 11 [2025-03-09 02:46:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2025-03-09 02:46:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2025-03-09 02:46:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:46:01,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:01,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:01,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:01,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:01,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_0_to_51_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:01,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1794973331, now seen corresponding path program 1 times [2025-03-09 02:46:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:01,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784334569] [2025-03-09 02:46:01,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:01,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:46:01,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:46:01,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:01,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:02,177 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:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784334569] [2025-03-09 02:46:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784334569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:02,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:02,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830228750] [2025-03-09 02:46:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:02,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:02,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:02,181 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand has 7 states, 5 states have (on average 2.2) 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:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:02,318 INFO L93 Difference]: Finished difference Result 221 states and 248 transitions. [2025-03-09 02:46:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) 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:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:02,320 INFO L225 Difference]: With dead ends: 221 [2025-03-09 02:46:02,321 INFO L226 Difference]: Without dead ends: 220 [2025-03-09 02:46:02,322 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:02,323 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 200 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 517 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:02,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 517 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:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-09 02:46:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 154. [2025-03-09 02:46:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 100 states have (on average 1.71) internal successors, (171), 143 states have internal predecessors, (171), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-09 02:46:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2025-03-09 02:46:02,341 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 12 [2025-03-09 02:46:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:02,341 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2025-03-09 02:46:02,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) 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:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2025-03-09 02:46:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:46:02,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:02,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:02,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:46:02,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_0_to_51_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:02,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash 190401665, now seen corresponding path program 1 times [2025-03-09 02:46:02,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:02,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057563243] [2025-03-09 02:46:02,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:02,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:46:02,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:46:02,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:02,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:02,537 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:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057563243] [2025-03-09 02:46:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057563243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:02,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331253344] [2025-03-09 02:46:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:02,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:02,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:02,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:02,539 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 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:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:02,662 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2025-03-09 02:46:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:02,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 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:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:02,664 INFO L225 Difference]: With dead ends: 220 [2025-03-09 02:46:02,664 INFO L226 Difference]: Without dead ends: 219 [2025-03-09 02:46:02,664 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:02,665 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 196 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:02,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 527 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-09 02:46:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 154. [2025-03-09 02:46:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 100 states have (on average 1.69) internal successors, (169), 143 states have internal predecessors, (169), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-09 02:46:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2025-03-09 02:46:02,672 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 187 transitions. Word has length 13 [2025-03-09 02:46:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:02,672 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 187 transitions. [2025-03-09 02:46:02,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 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:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 187 transitions. [2025-03-09 02:46:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:46:02,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:02,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:02,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:46:02,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_0_to_51_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:02,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1607484395, now seen corresponding path program 1 times [2025-03-09 02:46:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:02,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921131318] [2025-03-09 02:46:02,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:02,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:46:02,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:46:02,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:02,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:02,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501705090] [2025-03-09 02:46:02,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:02,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:02,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:02,702 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:02,704 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:02,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:46:02,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:46:02,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:02,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:02,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 02:46:02,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:02,806 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:02,809 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:02,892 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:02,896 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:02,906 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:02,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:02,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921131318] [2025-03-09 02:46:02,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501705090] [2025-03-09 02:46:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501705090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:02,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220711657] [2025-03-09 02:46:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:02,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:02,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:02,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:02,908 INFO L87 Difference]: Start difference. First operand 154 states and 187 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:02,999 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2025-03-09 02:46:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:03,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 14 [2025-03-09 02:46:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:03,001 INFO L225 Difference]: With dead ends: 154 [2025-03-09 02:46:03,001 INFO L226 Difference]: Without dead ends: 153 [2025-03-09 02:46:03,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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:03,002 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 185 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 451 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:03,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 451 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:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-09 02:46:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-09 02:46:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 100 states have (on average 1.66) internal successors, (166), 142 states have internal predecessors, (166), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-09 02:46:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 184 transitions. [2025-03-09 02:46:03,012 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 184 transitions. Word has length 14 [2025-03-09 02:46:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 184 transitions. [2025-03-09 02:46:03,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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,013 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2025-03-09 02:46:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:46:03,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:03,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:03,021 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:03,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:03,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_0_to_51_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:03,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1707591233, now seen corresponding path program 1 times [2025-03-09 02:46:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:03,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950760687] [2025-03-09 02:46:03,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:03,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:46:03,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:46:03,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:03,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:03,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158150607] [2025-03-09 02:46:03,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:03,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:03,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:03,237 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:03,239 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:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:46:03,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:46:03,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:03,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:03,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-09 02:46:03,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:03,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:03,344 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,364 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,367 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,372 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:03,444 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:03,451 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:03,485 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:03,607 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,614 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:03,690 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,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950760687] [2025-03-09 02:46:03,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158150607] [2025-03-09 02:46:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158150607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 02:46:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038127937] [2025-03-09 02:46:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:46:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:03,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:46:03,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:03,691 INFO L87 Difference]: Start difference. First operand 153 states and 184 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:04,218 INFO L93 Difference]: Finished difference Result 227 states and 265 transitions. [2025-03-09 02:46:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:46:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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 15 [2025-03-09 02:46:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:04,220 INFO L225 Difference]: With dead ends: 227 [2025-03-09 02:46:04,220 INFO L226 Difference]: Without dead ends: 226 [2025-03-09 02:46:04,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:46:04,220 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 175 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:04,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 857 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-09 02:46:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 191. [2025-03-09 02:46:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 180 states have internal predecessors, (237), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (13), 8 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-09 02:46:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2025-03-09 02:46:04,229 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 15 [2025-03-09 02:46:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:04,229 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2025-03-09 02:46:04,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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,229 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2025-03-09 02:46:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:46:04,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:04,230 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:04,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:04,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:04,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_0_to_51_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:04,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1369345293, now seen corresponding path program 1 times [2025-03-09 02:46:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606325637] [2025-03-09 02:46:04,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:04,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:46:04,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:46:04,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:04,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:04,692 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,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606325637] [2025-03-09 02:46:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606325637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:04,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:04,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401492697] [2025-03-09 02:46:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:04,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:04,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:04,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:04,694 INFO L87 Difference]: Start difference. First operand 191 states and 259 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 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:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:04,845 INFO L93 Difference]: Finished difference Result 267 states and 351 transitions. [2025-03-09 02:46:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 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:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:04,846 INFO L225 Difference]: With dead ends: 267 [2025-03-09 02:46:04,846 INFO L226 Difference]: Without dead ends: 266 [2025-03-09 02:46:04,847 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:04,847 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 120 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:04,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 582 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-09 02:46:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2025-03-09 02:46:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 169 states have (on average 1.7396449704142012) internal successors, (294), 215 states have internal predecessors, (294), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (22), 10 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-09 02:46:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 328 transitions. [2025-03-09 02:46:04,862 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 328 transitions. Word has length 26 [2025-03-09 02:46:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:04,863 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 328 transitions. [2025-03-09 02:46:04,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 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:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 328 transitions. [2025-03-09 02:46:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:46:04,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:04,864 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] [2025-03-09 02:46:04,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:46:04,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash -500857447, now seen corresponding path program 1 times [2025-03-09 02:46:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:04,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360424457] [2025-03-09 02:46:04,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:04,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:46:04,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:46:04,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:04,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:05,128 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,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:05,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360424457] [2025-03-09 02:46:05,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360424457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:05,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:05,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:46:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827216396] [2025-03-09 02:46:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:05,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:05,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:05,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:05,129 INFO L87 Difference]: Start difference. First operand 229 states and 328 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:05,277 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2025-03-09 02:46:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:46:05,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 27 [2025-03-09 02:46:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:05,279 INFO L225 Difference]: With dead ends: 269 [2025-03-09 02:46:05,280 INFO L226 Difference]: Without dead ends: 252 [2025-03-09 02:46:05,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:46:05,280 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 122 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:05,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 491 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-09 02:46:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2025-03-09 02:46:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 172 states have (on average 1.7325581395348837) internal successors, (298), 221 states have internal predecessors, (298), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 11 states have call predecessors, (31), 14 states have call successors, (31) [2025-03-09 02:46:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2025-03-09 02:46:05,302 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 27 [2025-03-09 02:46:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:05,303 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2025-03-09 02:46:05,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2025-03-09 02:46:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:46:05,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:05,304 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] [2025-03-09 02:46:05,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:46:05,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_0_to_51_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:05,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash -499968875, now seen corresponding path program 1 times [2025-03-09 02:46:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:05,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067967552] [2025-03-09 02:46:05,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:46:05,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:46:05,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:05,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:05,551 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,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:05,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067967552] [2025-03-09 02:46:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067967552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350734410] [2025-03-09 02:46:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:05,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:05,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:05,553 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:05,675 INFO L93 Difference]: Finished difference Result 272 states and 363 transitions. [2025-03-09 02:46:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:05,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 27 [2025-03-09 02:46:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:05,676 INFO L225 Difference]: With dead ends: 272 [2025-03-09 02:46:05,676 INFO L226 Difference]: Without dead ends: 271 [2025-03-09 02:46:05,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 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:05,677 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 117 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:05,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 585 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-09 02:46:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 235. [2025-03-09 02:46:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 172 states have (on average 1.7151162790697674) internal successors, (295), 221 states have internal predecessors, (295), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 11 states have call predecessors, (31), 14 states have call successors, (31) [2025-03-09 02:46:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 340 transitions. [2025-03-09 02:46:05,688 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 340 transitions. Word has length 27 [2025-03-09 02:46:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:05,689 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 340 transitions. [2025-03-09 02:46:05,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 340 transitions. [2025-03-09 02:46:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:46:05,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:05,689 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] [2025-03-09 02:46:05,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:46:05,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:05,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash -472228296, now seen corresponding path program 1 times [2025-03-09 02:46:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547899959] [2025-03-09 02:46:05,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:05,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:46:05,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:46:05,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:05,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415955733] [2025-03-09 02:46:05,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:05,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:05,714 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:46:05,715 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:46:05,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:46:05,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:46:05,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:05,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:05,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 02:46:05,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:05,803 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:05,808 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 11 treesize of output 7 [2025-03-09 02:46:05,905 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,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:05,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:05,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547899959] [2025-03-09 02:46:05,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:05,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415955733] [2025-03-09 02:46:05,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415955733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:05,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:05,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:05,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435663101] [2025-03-09 02:46:05,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:05,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:05,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:05,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:05,907 INFO L87 Difference]: Start difference. First operand 235 states and 340 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:06,063 INFO L93 Difference]: Finished difference Result 478 states and 752 transitions. [2025-03-09 02:46:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:46:06,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 27 [2025-03-09 02:46:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:06,065 INFO L225 Difference]: With dead ends: 478 [2025-03-09 02:46:06,065 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 02:46:06,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:06,067 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 98 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:06,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 537 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 02:46:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2025-03-09 02:46:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 183 states have (on average 1.6612021857923498) internal successors, (304), 234 states have internal predecessors, (304), 16 states have call successors, (16), 5 states have call predecessors, (16), 14 states have return successors, (63), 16 states have call predecessors, (63), 16 states have call successors, (63) [2025-03-09 02:46:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2025-03-09 02:46:06,084 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 27 [2025-03-09 02:46:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:06,084 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2025-03-09 02:46:06,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2025-03-09 02:46:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:46:06,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:06,086 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] [2025-03-09 02:46:06,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:06,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:06,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_0_to_51_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:06,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1680834059, now seen corresponding path program 1 times [2025-03-09 02:46:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:06,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639462114] [2025-03-09 02:46:06,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:06,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:46:06,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:46:06,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:06,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:06,459 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,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639462114] [2025-03-09 02:46:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639462114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:06,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:06,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910096078] [2025-03-09 02:46:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:06,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:06,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:06,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:06,461 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:06,592 INFO L93 Difference]: Finished difference Result 343 states and 504 transitions. [2025-03-09 02:46:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:06,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 28 [2025-03-09 02:46:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:06,594 INFO L225 Difference]: With dead ends: 343 [2025-03-09 02:46:06,594 INFO L226 Difference]: Without dead ends: 342 [2025-03-09 02:46:06,594 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:06,595 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 124 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:06,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 577 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-09 02:46:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 297. [2025-03-09 02:46:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 219 states have (on average 1.6621004566210045) internal successors, (364), 273 states have internal predecessors, (364), 19 states have call successors, (19), 6 states have call predecessors, (19), 18 states have return successors, (84), 19 states have call predecessors, (84), 19 states have call successors, (84) [2025-03-09 02:46:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 467 transitions. [2025-03-09 02:46:06,612 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 467 transitions. Word has length 28 [2025-03-09 02:46:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:06,613 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 467 transitions. [2025-03-09 02:46:06,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 467 transitions. [2025-03-09 02:46:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:46:06,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:06,613 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] [2025-03-09 02:46:06,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:46:06,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_0_to_51_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:06,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1682587467, now seen corresponding path program 1 times [2025-03-09 02:46:06,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:06,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7172551] [2025-03-09 02:46:06,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:06,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:46:06,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:46:06,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:06,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:06,760 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,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7172551] [2025-03-09 02:46:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7172551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:06,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921086679] [2025-03-09 02:46:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:06,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:06,761 INFO L87 Difference]: Start difference. First operand 297 states and 467 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:06,881 INFO L93 Difference]: Finished difference Result 367 states and 551 transitions. [2025-03-09 02:46:06,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:06,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 28 [2025-03-09 02:46:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:06,883 INFO L225 Difference]: With dead ends: 367 [2025-03-09 02:46:06,884 INFO L226 Difference]: Without dead ends: 366 [2025-03-09 02:46:06,884 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:06,884 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 96 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:06,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 612 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-09 02:46:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 334. [2025-03-09 02:46:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 250 states have (on average 1.66) internal successors, (415), 306 states have internal predecessors, (415), 21 states have call successors, (21), 7 states have call predecessors, (21), 22 states have return successors, (93), 22 states have call predecessors, (93), 21 states have call successors, (93) [2025-03-09 02:46:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 529 transitions. [2025-03-09 02:46:06,903 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 529 transitions. Word has length 28 [2025-03-09 02:46:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:06,903 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 529 transitions. [2025-03-09 02:46:06,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 529 transitions. [2025-03-09 02:46:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:46:06,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:06,904 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:06,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:46:06,904 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_0_to_51_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:06,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash 566248275, now seen corresponding path program 1 times [2025-03-09 02:46:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:06,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520295559] [2025-03-09 02:46:06,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:06,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:46:06,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:46:06,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:06,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:07,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:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:07,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520295559] [2025-03-09 02:46:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520295559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:07,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:07,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969003514] [2025-03-09 02:46:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:07,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:07,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:07,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:07,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:07,084 INFO L87 Difference]: Start difference. First operand 334 states and 529 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (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,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:07,211 INFO L93 Difference]: Finished difference Result 379 states and 563 transitions. [2025-03-09 02:46:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:07,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (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 29 [2025-03-09 02:46:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:07,213 INFO L225 Difference]: With dead ends: 379 [2025-03-09 02:46:07,213 INFO L226 Difference]: Without dead ends: 378 [2025-03-09 02:46:07,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 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,213 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 121 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:07,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 580 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-09 02:46:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 334. [2025-03-09 02:46:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 250 states have (on average 1.648) internal successors, (412), 306 states have internal predecessors, (412), 21 states have call successors, (21), 7 states have call predecessors, (21), 22 states have return successors, (93), 22 states have call predecessors, (93), 21 states have call successors, (93) [2025-03-09 02:46:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 526 transitions. [2025-03-09 02:46:07,231 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 526 transitions. Word has length 29 [2025-03-09 02:46:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:07,231 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 526 transitions. [2025-03-09 02:46:07,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (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,231 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 526 transitions. [2025-03-09 02:46:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:46:07,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:07,232 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:07,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:46:07,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_0_to_51_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:07,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash 620603940, now seen corresponding path program 1 times [2025-03-09 02:46:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:07,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048214849] [2025-03-09 02:46:07,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:46:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:46:07,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:07,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:07,372 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,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:07,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048214849] [2025-03-09 02:46:07,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048214849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:07,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:07,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318912077] [2025-03-09 02:46:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:07,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:07,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:07,374 INFO L87 Difference]: Start difference. First operand 334 states and 526 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (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,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:07,501 INFO L93 Difference]: Finished difference Result 455 states and 703 transitions. [2025-03-09 02:46:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:07,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (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 29 [2025-03-09 02:46:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:07,504 INFO L225 Difference]: With dead ends: 455 [2025-03-09 02:46:07,504 INFO L226 Difference]: Without dead ends: 450 [2025-03-09 02:46:07,505 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,505 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 115 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:07,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 599 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-09 02:46:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 409. [2025-03-09 02:46:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 313 states have (on average 1.6517571884984026) internal successors, (517), 373 states have internal predecessors, (517), 26 states have call successors, (26), 9 states have call predecessors, (26), 29 states have return successors, (125), 28 states have call predecessors, (125), 26 states have call successors, (125) [2025-03-09 02:46:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 668 transitions. [2025-03-09 02:46:07,529 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 668 transitions. Word has length 29 [2025-03-09 02:46:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:07,530 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 668 transitions. [2025-03-09 02:46:07,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (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,530 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 668 transitions. [2025-03-09 02:46:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:07,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:07,531 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:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:46:07,531 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_0_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 373827337, now seen corresponding path program 1 times [2025-03-09 02:46:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458967384] [2025-03-09 02:46:07,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:07,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:07,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:07,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:07,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:07,638 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,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:07,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458967384] [2025-03-09 02:46:07,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458967384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:07,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600031511] [2025-03-09 02:46:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:07,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:07,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:07,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:07,639 INFO L87 Difference]: Start difference. First operand 409 states and 668 transitions. Second operand has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:07,725 INFO L93 Difference]: Finished difference Result 537 states and 842 transitions. [2025-03-09 02:46:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2025-03-09 02:46:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:07,727 INFO L225 Difference]: With dead ends: 537 [2025-03-09 02:46:07,727 INFO L226 Difference]: Without dead ends: 535 [2025-03-09 02:46:07,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:07,728 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 175 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:07,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 546 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-09 02:46:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 485. [2025-03-09 02:46:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 380 states have (on average 1.6552631578947368) internal successors, (629), 444 states have internal predecessors, (629), 30 states have call successors, (30), 10 states have call predecessors, (30), 34 states have return successors, (160), 32 states have call predecessors, (160), 30 states have call successors, (160) [2025-03-09 02:46:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 819 transitions. [2025-03-09 02:46:07,754 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 819 transitions. Word has length 30 [2025-03-09 02:46:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:07,755 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 819 transitions. [2025-03-09 02:46:07,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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,755 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 819 transitions. [2025-03-09 02:46:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:07,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:07,755 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:07,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:46:07,755 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_0_to_51_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:07,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2058852969, now seen corresponding path program 1 times [2025-03-09 02:46:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463495636] [2025-03-09 02:46:07,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:07,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:07,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:07,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:08,011 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,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463495636] [2025-03-09 02:46:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463495636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:08,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937075166] [2025-03-09 02:46:08,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:08,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:08,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:08,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:08,013 INFO L87 Difference]: Start difference. First operand 485 states and 819 transitions. Second operand has 5 states, 5 states have (on average 5.4) 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:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:08,094 INFO L93 Difference]: Finished difference Result 1015 states and 1928 transitions. [2025-03-09 02:46:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:08,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) 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:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:08,097 INFO L225 Difference]: With dead ends: 1015 [2025-03-09 02:46:08,097 INFO L226 Difference]: Without dead ends: 589 [2025-03-09 02:46:08,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:08,101 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 28 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:08,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 416 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-09 02:46:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 506. [2025-03-09 02:46:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 401 states have (on average 1.6433915211970074) internal successors, (659), 465 states have internal predecessors, (659), 30 states have call successors, (30), 10 states have call predecessors, (30), 34 states have return successors, (160), 32 states have call predecessors, (160), 30 states have call successors, (160) [2025-03-09 02:46:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 849 transitions. [2025-03-09 02:46:08,137 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 849 transitions. Word has length 30 [2025-03-09 02:46:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,137 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 849 transitions. [2025-03-09 02:46:08,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) 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:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 849 transitions. [2025-03-09 02:46:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:08,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,138 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:08,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:46:08,138 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_0_to_51_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:08,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2061038666, now seen corresponding path program 1 times [2025-03-09 02:46:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010330997] [2025-03-09 02:46:08,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:08,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:08,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:08,310 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,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010330997] [2025-03-09 02:46:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010330997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:08,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:08,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:08,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883719203] [2025-03-09 02:46:08,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:08,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:08,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:08,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:08,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:08,312 INFO L87 Difference]: Start difference. First operand 506 states and 849 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:08,464 INFO L93 Difference]: Finished difference Result 535 states and 866 transitions. [2025-03-09 02:46:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2025-03-09 02:46:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:08,468 INFO L225 Difference]: With dead ends: 535 [2025-03-09 02:46:08,468 INFO L226 Difference]: Without dead ends: 534 [2025-03-09 02:46:08,468 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,468 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 90 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:08,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 612 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-09 02:46:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 507. [2025-03-09 02:46:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 402 states have (on average 1.6393034825870647) internal successors, (659), 466 states have internal predecessors, (659), 30 states have call successors, (30), 10 states have call predecessors, (30), 34 states have return successors, (160), 32 states have call predecessors, (160), 30 states have call successors, (160) [2025-03-09 02:46:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 849 transitions. [2025-03-09 02:46:08,497 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 849 transitions. Word has length 30 [2025-03-09 02:46:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 849 transitions. [2025-03-09 02:46:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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,497 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 849 transitions. [2025-03-09 02:46:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:08,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,498 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:08,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:46:08,498 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_0_to_51_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2061037866, now seen corresponding path program 1 times [2025-03-09 02:46:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616674626] [2025-03-09 02:46:08,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 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 30 of 30 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,642 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,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616674626] [2025-03-09 02:46:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616674626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085704542] [2025-03-09 02:46:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:08,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:08,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:08,643 INFO L87 Difference]: Start difference. First operand 507 states and 849 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:08,780 INFO L93 Difference]: Finished difference Result 546 states and 877 transitions. [2025-03-09 02:46:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:08,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2025-03-09 02:46:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:08,783 INFO L225 Difference]: With dead ends: 546 [2025-03-09 02:46:08,783 INFO L226 Difference]: Without dead ends: 545 [2025-03-09 02:46:08,783 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,784 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 108 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:08,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 623 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-09 02:46:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 512. [2025-03-09 02:46:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 407 states have (on average 1.633906633906634) internal successors, (665), 471 states have internal predecessors, (665), 30 states have call successors, (30), 10 states have call predecessors, (30), 34 states have return successors, (160), 32 states have call predecessors, (160), 30 states have call successors, (160) [2025-03-09 02:46:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 855 transitions. [2025-03-09 02:46:08,813 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 855 transitions. Word has length 30 [2025-03-09 02:46:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:08,813 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 855 transitions. [2025-03-09 02:46:08,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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,813 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 855 transitions. [2025-03-09 02:46:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:08,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:08,813 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:08,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:46:08,814 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_0_to_51_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:08,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1348610646, now seen corresponding path program 1 times [2025-03-09 02:46:08,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:08,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681803202] [2025-03-09 02:46:08,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:08,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:08,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:08,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:08,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576983070] [2025-03-09 02:46:08,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:08,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:08,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:46:08,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:08,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:08,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:08,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:08,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 02:46:08,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:08,964 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:08,968 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:08,970 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,099 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:09,102 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:09,111 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,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681803202] [2025-03-09 02:46:09,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576983070] [2025-03-09 02:46:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576983070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:09,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:09,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084220349] [2025-03-09 02:46:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:09,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:09,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:09,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:09,112 INFO L87 Difference]: Start difference. First operand 512 states and 855 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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:13,190 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:17,223 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:21,232 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:25,250 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:29,292 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:33,302 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:37,309 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:41,315 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:45,319 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:49,327 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:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:49,382 INFO L93 Difference]: Finished difference Result 564 states and 894 transitions. [2025-03-09 02:46:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:46:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 30 [2025-03-09 02:46:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:49,385 INFO L225 Difference]: With dead ends: 564 [2025-03-09 02:46:49,385 INFO L226 Difference]: Without dead ends: 563 [2025-03-09 02:46:49,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:49,386 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 123 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 10 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:49,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 699 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 40.2s Time] [2025-03-09 02:46:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-09 02:46:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 525. [2025-03-09 02:46:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 417 states have (on average 1.618705035971223) internal successors, (675), 480 states have internal predecessors, (675), 31 states have call successors, (31), 11 states have call predecessors, (31), 36 states have return successors, (161), 35 states have call predecessors, (161), 31 states have call successors, (161) [2025-03-09 02:46:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 867 transitions. [2025-03-09 02:46:49,412 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 867 transitions. Word has length 30 [2025-03-09 02:46:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:49,412 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 867 transitions. [2025-03-09 02:46:49,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 867 transitions. [2025-03-09 02:46:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:46:49,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:49,413 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, 1] [2025-03-09 02:46:49,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:46:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 02:46:49,617 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_0_to_51_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:49,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash -532310741, now seen corresponding path program 1 times [2025-03-09 02:46:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615943802] [2025-03-09 02:46:49,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:49,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:46:49,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:46:49,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:49,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:49,753 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:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615943802] [2025-03-09 02:46:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615943802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:49,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:49,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243585952] [2025-03-09 02:46:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:49,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:49,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:49,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:49,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:49,758 INFO L87 Difference]: Start difference. First operand 525 states and 867 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:49,906 INFO L93 Difference]: Finished difference Result 617 states and 985 transitions. [2025-03-09 02:46:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 31 [2025-03-09 02:46:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:49,909 INFO L225 Difference]: With dead ends: 617 [2025-03-09 02:46:49,909 INFO L226 Difference]: Without dead ends: 616 [2025-03-09 02:46:49,909 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:49,910 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:49,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 632 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-09 02:46:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 577. [2025-03-09 02:46:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 462 states have (on average 1.6277056277056277) internal successors, (752), 528 states have internal predecessors, (752), 34 states have call successors, (34), 12 states have call predecessors, (34), 40 states have return successors, (181), 38 states have call predecessors, (181), 34 states have call successors, (181) [2025-03-09 02:46:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 967 transitions. [2025-03-09 02:46:49,939 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 967 transitions. Word has length 31 [2025-03-09 02:46:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:49,939 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 967 transitions. [2025-03-09 02:46:49,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 967 transitions. [2025-03-09 02:46:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:46:49,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:49,939 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, 1] [2025-03-09 02:46:49,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:46:49,940 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_0_to_51_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:49,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash -532335566, now seen corresponding path program 1 times [2025-03-09 02:46:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:49,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245523422] [2025-03-09 02:46:49,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:49,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:49,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:46:49,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:46:49,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:49,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:50,064 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:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245523422] [2025-03-09 02:46:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245523422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:50,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604772839] [2025-03-09 02:46:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:50,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:50,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:50,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:50,066 INFO L87 Difference]: Start difference. First operand 577 states and 967 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:50,206 INFO L93 Difference]: Finished difference Result 626 states and 1003 transitions. [2025-03-09 02:46:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 31 [2025-03-09 02:46:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:50,209 INFO L225 Difference]: With dead ends: 626 [2025-03-09 02:46:50,210 INFO L226 Difference]: Without dead ends: 625 [2025-03-09 02:46:50,210 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:50,210 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 127 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:50,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 626 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-09 02:46:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 577. [2025-03-09 02:46:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 462 states have (on average 1.621212121212121) internal successors, (749), 528 states have internal predecessors, (749), 34 states have call successors, (34), 12 states have call predecessors, (34), 40 states have return successors, (181), 38 states have call predecessors, (181), 34 states have call successors, (181) [2025-03-09 02:46:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 964 transitions. [2025-03-09 02:46:50,242 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 964 transitions. Word has length 31 [2025-03-09 02:46:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:50,242 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 964 transitions. [2025-03-09 02:46:50,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 964 transitions. [2025-03-09 02:46:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:46:50,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:50,244 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, 1] [2025-03-09 02:46:50,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 02:46:50,245 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_0_to_51_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:46:50,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1142742945, now seen corresponding path program 1 times [2025-03-09 02:46:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978305858] [2025-03-09 02:46:50,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:50,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:46:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:46:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744497636] [2025-03-09 02:46:50,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:50,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:50,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:50,272 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:50,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:46:50,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:46:50,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:46:50,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:50,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:50,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 02:46:50,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:50,394 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:50,417 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:50,422 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:50,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:50,611 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:50,624 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:50,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:50,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:50,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978305858] [2025-03-09 02:46:50,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:50,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744497636] [2025-03-09 02:46:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744497636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006653403] [2025-03-09 02:46:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:50,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:50,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:50,627 INFO L87 Difference]: Start difference. First operand 577 states and 964 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:54,715 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:58,751 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,766 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,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:02,894 INFO L93 Difference]: Finished difference Result 614 states and 988 transitions. [2025-03-09 02:47:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:47:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 31 [2025-03-09 02:47:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:02,897 INFO L225 Difference]: With dead ends: 614 [2025-03-09 02:47:02,898 INFO L226 Difference]: Without dead ends: 613 [2025-03-09 02:47:02,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:47:02,898 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 162 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:02,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 573 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 191 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-03-09 02:47:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-09 02:47:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 577. [2025-03-09 02:47:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 462 states have (on average 1.6168831168831168) internal successors, (747), 528 states have internal predecessors, (747), 34 states have call successors, (34), 12 states have call predecessors, (34), 40 states have return successors, (181), 38 states have call predecessors, (181), 34 states have call successors, (181) [2025-03-09 02:47:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 962 transitions. [2025-03-09 02:47:02,935 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 962 transitions. Word has length 31 [2025-03-09 02:47:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:02,935 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 962 transitions. [2025-03-09 02:47:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:47:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 962 transitions. [2025-03-09 02:47:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:47:02,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:02,936 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, 1, 1] [2025-03-09 02:47:02,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:47:03,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 02:47:03,140 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_0_to_51_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:47:03,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 678236264, now seen corresponding path program 1 times [2025-03-09 02:47:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192230056] [2025-03-09 02:47:03,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:03,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:47:03,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:47:03,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:03,257 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:47:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:03,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192230056] [2025-03-09 02:47:03,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192230056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:03,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:03,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200112956] [2025-03-09 02:47:03,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:03,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:03,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:03,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:03,259 INFO L87 Difference]: Start difference. First operand 577 states and 962 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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:47:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:03,406 INFO L93 Difference]: Finished difference Result 606 states and 982 transitions. [2025-03-09 02:47:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:03,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 32 [2025-03-09 02:47:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:03,409 INFO L225 Difference]: With dead ends: 606 [2025-03-09 02:47:03,409 INFO L226 Difference]: Without dead ends: 605 [2025-03-09 02:47:03,409 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:47:03,410 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:03,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 619 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-09 02:47:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 580. [2025-03-09 02:47:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 465 states have (on average 1.6150537634408602) internal successors, (751), 531 states have internal predecessors, (751), 34 states have call successors, (34), 12 states have call predecessors, (34), 40 states have return successors, (181), 38 states have call predecessors, (181), 34 states have call successors, (181) [2025-03-09 02:47:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 966 transitions. [2025-03-09 02:47:03,441 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 966 transitions. Word has length 32 [2025-03-09 02:47:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:03,441 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 966 transitions. [2025-03-09 02:47:03,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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:47:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 966 transitions. [2025-03-09 02:47:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:47:03,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:03,442 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, 1, 1] [2025-03-09 02:47:03,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 02:47:03,442 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_0_to_51_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:47:03,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash 677466664, now seen corresponding path program 1 times [2025-03-09 02:47:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491105095] [2025-03-09 02:47:03,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:03,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:47:03,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:47:03,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:03,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1661165871] [2025-03-09 02:47:03,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:03,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:03,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:03,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:03,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:47:03,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:47:03,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:47:03,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:03,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 02:47:03,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:03,580 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:03,590 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:03,591 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:47:03,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:47:03,724 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:47:03,735 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:47:03,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491105095] [2025-03-09 02:47:03,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661165871] [2025-03-09 02:47:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661165871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:03,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:47:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21399274] [2025-03-09 02:47:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:47:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:03,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:47:03,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:47:03,736 INFO L87 Difference]: Start difference. First operand 580 states and 966 transitions. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:47:07,800 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:11,820 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:15,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:47:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:15,980 INFO L93 Difference]: Finished difference Result 625 states and 998 transitions. [2025-03-09 02:47:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:47:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 32 [2025-03-09 02:47:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:15,982 INFO L225 Difference]: With dead ends: 625 [2025-03-09 02:47:15,982 INFO L226 Difference]: Without dead ends: 624 [2025-03-09 02:47:15,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:47:15,983 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 100 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:15,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-03-09 02:47:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-09 02:47:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 591. [2025-03-09 02:47:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 473 states have (on average 1.6046511627906976) internal successors, (759), 540 states have internal predecessors, (759), 36 states have call successors, (36), 14 states have call predecessors, (36), 41 states have return successors, (178), 40 states have call predecessors, (178), 36 states have call successors, (178) [2025-03-09 02:47:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 973 transitions. [2025-03-09 02:47:16,015 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 973 transitions. Word has length 32 [2025-03-09 02:47:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:16,015 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 973 transitions. [2025-03-09 02:47:16,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:47:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 973 transitions. [2025-03-09 02:47:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:47:16,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:16,016 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, 1, 1] [2025-03-09 02:47:16,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:47:16,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 02:47:16,220 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_0_to_51_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:47:16,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1065292936, now seen corresponding path program 1 times [2025-03-09 02:47:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581873181] [2025-03-09 02:47:16,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:16,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:47:16,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:47:16,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:16,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:16,311 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:47:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581873181] [2025-03-09 02:47:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581873181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:16,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:16,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099415527] [2025-03-09 02:47:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:16,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:16,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:16,313 INFO L87 Difference]: Start difference. First operand 591 states and 973 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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:47:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:16,432 INFO L93 Difference]: Finished difference Result 652 states and 1029 transitions. [2025-03-09 02:47:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:47:16,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 32 [2025-03-09 02:47:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:16,435 INFO L225 Difference]: With dead ends: 652 [2025-03-09 02:47:16,435 INFO L226 Difference]: Without dead ends: 651 [2025-03-09 02:47:16,435 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:47:16,436 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 157 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:16,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 515 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-09 02:47:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 596. [2025-03-09 02:47:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 478 states have (on average 1.604602510460251) internal successors, (767), 545 states have internal predecessors, (767), 36 states have call successors, (36), 14 states have call predecessors, (36), 41 states have return successors, (178), 40 states have call predecessors, (178), 36 states have call successors, (178) [2025-03-09 02:47:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 981 transitions. [2025-03-09 02:47:16,473 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 981 transitions. Word has length 32 [2025-03-09 02:47:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:16,473 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 981 transitions. [2025-03-09 02:47:16,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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:47:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 981 transitions. [2025-03-09 02:47:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:47:16,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:16,473 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, 1, 1, 1] [2025-03-09 02:47:16,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 02:47:16,473 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_0_to_51_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:47:16,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -449512247, now seen corresponding path program 1 times [2025-03-09 02:47:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:16,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775056734] [2025-03-09 02:47:16,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:16,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:47:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:47:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:16,591 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:47:16,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:16,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775056734] [2025-03-09 02:47:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775056734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:16,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:16,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:16,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017279198] [2025-03-09 02:47:16,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:16,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:16,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:16,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:16,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:16,593 INFO L87 Difference]: Start difference. First operand 596 states and 981 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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:47:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:16,729 INFO L93 Difference]: Finished difference Result 740 states and 1189 transitions. [2025-03-09 02:47:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:16,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 33 [2025-03-09 02:47:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:16,732 INFO L225 Difference]: With dead ends: 740 [2025-03-09 02:47:16,732 INFO L226 Difference]: Without dead ends: 739 [2025-03-09 02:47:16,732 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:47:16,733 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 143 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:16,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 650 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-09 02:47:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 689. [2025-03-09 02:47:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 560 states have (on average 1.6196428571428572) internal successors, (907), 631 states have internal predecessors, (907), 41 states have call successors, (41), 16 states have call predecessors, (41), 47 states have return successors, (207), 45 states have call predecessors, (207), 41 states have call successors, (207) [2025-03-09 02:47:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1155 transitions. [2025-03-09 02:47:16,764 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1155 transitions. Word has length 33 [2025-03-09 02:47:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:16,764 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1155 transitions. [2025-03-09 02:47:16,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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:47:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1155 transitions. [2025-03-09 02:47:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:47:16,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:16,765 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, 1, 1, 1] [2025-03-09 02:47:16,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 02:47:16,765 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_0_to_51_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:47:16,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:16,765 INFO L85 PathProgramCache]: Analyzing trace with hash -473369872, now seen corresponding path program 1 times [2025-03-09 02:47:16,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:16,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714535744] [2025-03-09 02:47:16,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:16,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:16,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:47:16,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:47:16,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:16,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:16,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640838664] [2025-03-09 02:47:16,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:16,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:16,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:16,795 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:16,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:47:16,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:47:16,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:47:16,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:16,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:16,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 02:47:16,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:16,928 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:16,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:47:16,939 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:16,942 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:47:17,129 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 11 [2025-03-09 02:47:17,144 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:47:17,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714535744] [2025-03-09 02:47:17,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640838664] [2025-03-09 02:47:17,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640838664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:17,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:17,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:47:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617973539] [2025-03-09 02:47:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:17,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:47:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:17,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:47:17,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:47:17,145 INFO L87 Difference]: Start difference. First operand 689 states and 1155 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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:47:21,258 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:25,274 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:29,286 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:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:29,441 INFO L93 Difference]: Finished difference Result 722 states and 1178 transitions. [2025-03-09 02:47:29,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:47:29,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 33 [2025-03-09 02:47:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:29,444 INFO L225 Difference]: With dead ends: 722 [2025-03-09 02:47:29,444 INFO L226 Difference]: Without dead ends: 721 [2025-03-09 02:47:29,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:47:29,445 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 151 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:29,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 504 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 199 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-03-09 02:47:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-09 02:47:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 689. [2025-03-09 02:47:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 560 states have (on average 1.6160714285714286) internal successors, (905), 631 states have internal predecessors, (905), 41 states have call successors, (41), 16 states have call predecessors, (41), 47 states have return successors, (207), 45 states have call predecessors, (207), 41 states have call successors, (207) [2025-03-09 02:47:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1153 transitions. [2025-03-09 02:47:29,477 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1153 transitions. Word has length 33 [2025-03-09 02:47:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:29,477 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1153 transitions. [2025-03-09 02:47:29,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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:47:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1153 transitions. [2025-03-09 02:47:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:47:29,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:29,477 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, 1, 1, 1] [2025-03-09 02:47:29,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:47:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:29,682 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting func_to_recursive_line_0_to_51_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:47:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1335657345, now seen corresponding path program 1 times [2025-03-09 02:47:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540600066] [2025-03-09 02:47:29,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:29,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:47:29,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:47:29,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:29,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:29,783 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:47:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540600066] [2025-03-09 02:47:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540600066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:29,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484137290] [2025-03-09 02:47:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:29,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:29,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:29,784 INFO L87 Difference]: Start difference. First operand 689 states and 1153 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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:47:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:29,913 INFO L93 Difference]: Finished difference Result 744 states and 1199 transitions. [2025-03-09 02:47:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:47:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 33 [2025-03-09 02:47:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:29,916 INFO L225 Difference]: With dead ends: 744 [2025-03-09 02:47:29,916 INFO L226 Difference]: Without dead ends: 743 [2025-03-09 02:47:29,917 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:47:29,917 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 153 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:29,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 521 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-09 02:47:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 690. [2025-03-09 02:47:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 561 states have (on average 1.6131907308377897) internal successors, (905), 632 states have internal predecessors, (905), 41 states have call successors, (41), 16 states have call predecessors, (41), 47 states have return successors, (207), 45 states have call predecessors, (207), 41 states have call successors, (207) [2025-03-09 02:47:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1153 transitions. [2025-03-09 02:47:29,959 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1153 transitions. Word has length 33 [2025-03-09 02:47:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:29,959 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1153 transitions. [2025-03-09 02:47:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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:47:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1153 transitions. [2025-03-09 02:47:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:47:29,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:29,960 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, 1] [2025-03-09 02:47:29,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 02:47:29,960 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting func_to_recursive_line_0_to_51_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 02:47:29,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 854646145, now seen corresponding path program 1 times [2025-03-09 02:47:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401998158] [2025-03-09 02:47:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:29,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:47:29,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:47:29,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:29,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:29,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224673185] [2025-03-09 02:47:29,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:29,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:29,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:29,991 INFO L229 MonitoredProcess]: Starting monitored process 13 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:29,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:47:30,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:47:30,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:47:30,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:30,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:30,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-09 02:47:30,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:30,152 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:30,155 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:30,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 11 treesize of output 7 [2025-03-09 02:47:30,175 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:47:30,183 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:30,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 19 treesize of output 11 [2025-03-09 02:47:30,395 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 26 treesize of output 14