./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 10:04:46,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:04:46,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:04:46,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:04:46,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:04:46,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:04:46,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:04:46,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:04:46,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:04:46,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:04:46,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:04:46,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:04:46,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:04:46,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:04:46,534 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:04:46,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:04:46,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:04:46,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:46,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:04:46,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:04:46,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:04:46,537 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-jdk21/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-02-08 10:04:46,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:04:46,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:04:46,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:04:46,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:04:46,783 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:04:46,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c [2025-02-08 10:04:47,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f6942ccb/33605a6d0f53476b8cf09b4f1892d264/FLAGd4f9fe488 [2025-02-08 10:04:48,173 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:04:48,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c [2025-02-08 10:04:48,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f6942ccb/33605a6d0f53476b8cf09b4f1892d264/FLAGd4f9fe488 [2025-02-08 10:04:48,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f6942ccb/33605a6d0f53476b8cf09b4f1892d264 [2025-02-08 10:04:48,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:04:48,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:04:48,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:48,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:04:48,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:04:48,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649a78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48, skipping insertion in model container [2025-02-08 10:04:48,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:04:48,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:48,640 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:04:48,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:48,678 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:04:48,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48 WrapperNode [2025-02-08 10:04:48,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:48,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:48,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:04:48,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:04:48,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,707 INFO L138 Inliner]: procedures = 16, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2025-02-08 10:04:48,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:48,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:04:48,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:04:48,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:04:48,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,732 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 4, 5, 15, 7, 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, 1, 1, 4, 2, 4, 4]. [2025-02-08 10:04:48,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:04:48,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:04:48,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:04:48,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:04:48,756 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (1/1) ... [2025-02-08 10:04:48,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:48,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:48,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 10:04:48,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:04:48,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:04:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 10:04:48,801 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_51_0 [2025-02-08 10:04:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_51_0 [2025-02-08 10:04:48,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:04:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:04:48,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:04:48,897 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:04:48,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:04:49,034 INFO L1324 $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-02-08 10:04:49,230 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-02-08 10:04:49,231 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:04:49,240 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:04:49,242 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:04:49,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:49 BoogieIcfgContainer [2025-02-08 10:04:49,242 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:04:49,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:04:49,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:04:49,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:04:49,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:04:48" (1/3) ... [2025-02-08 10:04:49,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ea532a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:49, skipping insertion in model container [2025-02-08 10:04:49,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:48" (2/3) ... [2025-02-08 10:04:49,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ea532a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:49, skipping insertion in model container [2025-02-08 10:04:49,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:49" (3/3) ... [2025-02-08 10:04:49,251 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_prod4br-ll.c [2025-02-08 10:04:49,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:04:49,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_prod4br-ll.c that has 3 procedures, 115 locations, 1 initial locations, 0 loop locations, and 42 error locations. [2025-02-08 10:04:49,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:04:49,320 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;@734a1a5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:04:49,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-08 10:04:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 65 states have (on average 1.8153846153846154) internal successors, (118), 108 states have internal predecessors, (118), 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-02-08 10:04:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:04:49,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:49,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:49,329 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-02-08 10:04:49,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1446905241, now seen corresponding path program 1 times [2025-02-08 10:04:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:49,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119378554] [2025-02-08 10:04:49,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:49,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:04:49,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:04:49,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:49,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:49,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119378554] [2025-02-08 10:04:49,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119378554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:49,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:49,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:04:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757234131] [2025-02-08 10:04:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 10:04:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:49,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 10:04:49,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:04:49,510 INFO L87 Difference]: Start difference. First operand has 115 states, 65 states have (on average 1.8153846153846154) internal successors, (118), 108 states have internal predecessors, (118), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 10:04:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:49,533 INFO L93 Difference]: Finished difference Result 228 states and 258 transitions. [2025-02-08 10:04:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 10:04:49,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2025-02-08 10:04:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:49,539 INFO L225 Difference]: With dead ends: 228 [2025-02-08 10:04:49,539 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 10:04:49,542 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-02-08 10:04:49,544 INFO L435 NwaCegarLoop]: 125 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, 125 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-02-08 10:04:49,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:04:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 10:04:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-08 10:04:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 62 states have (on average 1.7903225806451613) internal successors, (111), 104 states have internal predecessors, (111), 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-02-08 10:04:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2025-02-08 10:04:49,573 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 7 [2025-02-08 10:04:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:49,573 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2025-02-08 10:04:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 10:04:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2025-02-08 10:04:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:04:49,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:49,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:49,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:04:49,574 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-02-08 10:04:49,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1418276090, now seen corresponding path program 1 times [2025-02-08 10:04:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:49,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994747217] [2025-02-08 10:04:49,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:49,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:04:49,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:04:49,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:49,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828591664] [2025-02-08 10:04:49,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:49,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:49,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:49,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:04:49,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:04:49,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:04:49,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:49,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:49,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 10:04:49,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:49,837 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-02-08 10:04:49,860 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-02-08 10:04:49,913 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-02-08 10:04:49,919 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-02-08 10:04:49,923 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-02-08 10:04:49,930 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-02-08 10:04:49,987 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-02-08 10:04:49,992 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-02-08 10:04:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:50,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:50,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:50,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994747217] [2025-02-08 10:04:50,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:50,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828591664] [2025-02-08 10:04:50,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828591664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:50,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:50,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:50,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109446041] [2025-02-08 10:04:50,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:50,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:04:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:50,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:04:50,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:04:50,009 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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-02-08 10:04:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:50,293 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2025-02-08 10:04:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:50,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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 7 [2025-02-08 10:04:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:50,294 INFO L225 Difference]: With dead ends: 163 [2025-02-08 10:04:50,294 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 10:04:50,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 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-02-08 10:04:50,295 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 109 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 592 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-02-08 10:04:50,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 592 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:04:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 10:04:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2025-02-08 10:04:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.763157894736842) internal successors, (134), 118 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-02-08 10:04:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2025-02-08 10:04:50,312 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 7 [2025-02-08 10:04:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2025-02-08 10:04:50,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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-02-08 10:04:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2025-02-08 10:04:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 10:04:50,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:50,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:50,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 10:04:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:50,514 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-02-08 10:04:50,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1016885745, now seen corresponding path program 1 times [2025-02-08 10:04:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-02-08 10:04:50,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:50,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 10:04:50,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 10:04:50,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:50,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61191072] [2025-02-08 10:04:50,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:50,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:50,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:50,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:50,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 10:04:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 10:04:50,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 10:04:50,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:50,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 10:04:50,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:50,719 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-02-08 10:04:50,723 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-02-08 10:04:50,756 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-02-08 10:04:50,762 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-02-08 10:04:50,766 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-02-08 10:04:50,770 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-02-08 10:04:50,836 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-02-08 10:04:50,841 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-02-08 10:04:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:50,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-02-08 10:04:50,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61191072] [2025-02-08 10:04:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61191072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:50,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:50,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113835857] [2025-02-08 10:04:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:50,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:04:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:50,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:04:50,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:04:50,861 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-02-08 10:04:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:51,076 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2025-02-08 10:04:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:51,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-02-08 10:04:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:51,077 INFO L225 Difference]: With dead ends: 162 [2025-02-08 10:04:51,077 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 10:04:51,077 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-02-08 10:04:51,078 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 106 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 596 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-02-08 10:04:51,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 596 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:04:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 10:04:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2025-02-08 10:04:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.75) internal successors, (133), 118 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-02-08 10:04:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2025-02-08 10:04:51,084 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 8 [2025-02-08 10:04:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:51,084 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2025-02-08 10:04:51,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-02-08 10:04:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2025-02-08 10:04:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 10:04:51,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:51,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:51,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 10:04:51,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:51,289 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-02-08 10:04:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1458686940, now seen corresponding path program 1 times [2025-02-08 10:04:51,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:51,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40495972] [2025-02-08 10:04:51,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:51,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 10:04:51,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 10:04:51,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:51,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011927379] [2025-02-08 10:04:51,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:51,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:51,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:51,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:51,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 10:04:51,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 10:04:51,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 10:04:51,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:51,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:51,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 10:04:51,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:51,415 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-02-08 10:04:51,420 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-02-08 10:04:51,453 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-02-08 10:04:51,457 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-02-08 10:04:51,461 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-02-08 10:04:51,465 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-02-08 10:04:51,467 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-02-08 10:04:51,524 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-02-08 10:04:51,531 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-02-08 10:04:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:51,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:51,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40495972] [2025-02-08 10:04:51,570 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011927379] [2025-02-08 10:04:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011927379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:51,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:51,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:04:51,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640941705] [2025-02-08 10:04:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:51,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:04:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:51,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:04:51,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:04:51,572 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 9 states, 7 states have (on average 1.1428571428571428) 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-02-08 10:04:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:51,850 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2025-02-08 10:04:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:04:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.1428571428571428) 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-02-08 10:04:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:51,851 INFO L225 Difference]: With dead ends: 161 [2025-02-08 10:04:51,851 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 10:04:51,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-02-08 10:04:51,853 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 112 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 669 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-02-08 10:04:51,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 669 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:04:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 10:04:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 126. [2025-02-08 10:04:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.736842105263158) internal successors, (132), 118 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-02-08 10:04:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2025-02-08 10:04:51,863 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 9 [2025-02-08 10:04:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:51,863 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2025-02-08 10:04:51,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.1428571428571428) 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-02-08 10:04:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2025-02-08 10:04:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 10:04:51,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:51,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:51,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 10:04:52,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:52,064 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-02-08 10:04:52,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2025345197, now seen corresponding path program 1 times [2025-02-08 10:04:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258099658] [2025-02-08 10:04:52,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:52,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 10:04:52,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 10:04:52,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:52,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1124233364] [2025-02-08 10:04:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:52,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:52,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:52,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:52,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 10:04:52,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 10:04:52,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 10:04:52,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:52,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:52,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-08 10:04:52,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:52,194 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-02-08 10:04:52,196 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-02-08 10:04:52,227 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-02-08 10:04:52,231 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-02-08 10:04:52,234 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-02-08 10:04:52,238 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-02-08 10:04:52,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:04:52,296 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-02-08 10:04:52,301 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-02-08 10:04:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:52,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258099658] [2025-02-08 10:04:52,346 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:52,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124233364] [2025-02-08 10:04:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124233364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:52,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:04:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66746341] [2025-02-08 10:04:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:52,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:04:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:52,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:04:52,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:04:52,347 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-02-08 10:04:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:52,640 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2025-02-08 10:04:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:04:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-02-08 10:04:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:52,641 INFO L225 Difference]: With dead ends: 160 [2025-02-08 10:04:52,641 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 10:04:52,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-02-08 10:04:52,642 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 673 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-02-08 10:04:52,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 673 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:04:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 10:04:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2025-02-08 10:04:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 118 states have internal predecessors, (131), 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-02-08 10:04:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2025-02-08 10:04:52,647 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 10 [2025-02-08 10:04:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:52,648 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2025-02-08 10:04:52,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-02-08 10:04:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2025-02-08 10:04:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 10:04:52,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:52,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:52,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 10:04:52,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:52,852 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-02-08 10:04:52,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1638808254, now seen corresponding path program 1 times [2025-02-08 10:04:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-02-08 10:04:52,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:52,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 10:04:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 10:04:52,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:52,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-02-08 10:04:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055825286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:53,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314962220] [2025-02-08 10:04:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:53,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:53,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:53,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:53,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:53,068 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:53,264 INFO L93 Difference]: Finished difference Result 220 states and 247 transitions. [2025-02-08 10:04:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:04:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 10:04:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:53,266 INFO L225 Difference]: With dead ends: 220 [2025-02-08 10:04:53,267 INFO L226 Difference]: Without dead ends: 219 [2025-02-08 10:04:53,267 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-02-08 10:04:53,267 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 194 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 606 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-08 10:04:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 153. [2025-02-08 10:04:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 142 states have internal predecessors, (170), 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-02-08 10:04:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2025-02-08 10:04:53,275 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 11 [2025-02-08 10:04:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:53,275 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2025-02-08 10:04:53,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2025-02-08 10:04:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 10:04:53,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:53,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:53,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 10:04:53,276 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-02-08 10:04:53,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash 736551755, now seen corresponding path program 1 times [2025-02-08 10:04:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-02-08 10:04:53,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:53,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 10:04:53,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 10:04:53,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:53,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:53,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:53,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-02-08 10:04:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900194178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:53,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449234450] [2025-02-08 10:04:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:53,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:53,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:53,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:53,466 INFO L87 Difference]: Start difference. First operand 153 states and 188 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-02-08 10:04:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:53,575 INFO L93 Difference]: Finished difference Result 219 states and 245 transitions. [2025-02-08 10:04:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:04:53,576 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-02-08 10:04:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:53,577 INFO L225 Difference]: With dead ends: 219 [2025-02-08 10:04:53,577 INFO L226 Difference]: Without dead ends: 218 [2025-02-08 10:04:53,577 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-02-08 10:04:53,577 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 196 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 518 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-02-08 10:04:53,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 518 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-08 10:04:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2025-02-08 10:04:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.696969696969697) internal successors, (168), 142 states have internal predecessors, (168), 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-02-08 10:04:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 186 transitions. [2025-02-08 10:04:53,586 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 186 transitions. Word has length 12 [2025-02-08 10:04:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:53,586 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 186 transitions. [2025-02-08 10:04:53,586 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-02-08 10:04:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 186 transitions. [2025-02-08 10:04:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 10:04:53,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:53,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:53,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 10:04:53,586 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-02-08 10:04:53,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1358268000, now seen corresponding path program 1 times [2025-02-08 10:04:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:53,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166557519] [2025-02-08 10:04:53,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:53,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 10:04:53,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 10:04:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:53,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718883977] [2025-02-08 10:04:53,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:53,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:53,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:53,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:53,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 10:04:53,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 10:04:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 10:04:53,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:53,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:53,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-08 10:04:53,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:53,733 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-02-08 10:04:53,735 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-02-08 10:04:53,753 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-02-08 10:04:53,756 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-02-08 10:04:53,764 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-02-08 10:04:53,846 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-02-08 10:04:53,855 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-02-08 10:04:53,886 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-02-08 10:04:54,008 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-02-08 10:04:54,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 15 treesize of output 7 [2025-02-08 10:04:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:54,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166557519] [2025-02-08 10:04:54,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718883977] [2025-02-08 10:04:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718883977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:04:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214458404] [2025-02-08 10:04:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:54,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 10:04:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:54,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 10:04:54,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:04:54,053 INFO L87 Difference]: Start difference. First operand 153 states and 186 transitions. Second operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-02-08 10:04:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:54,645 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2025-02-08 10:04:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 10:04:54,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-02-08 10:04:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:54,646 INFO L225 Difference]: With dead ends: 228 [2025-02-08 10:04:54,646 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 10:04:54,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-02-08 10:04:54,647 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 182 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:54,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 853 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:04:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 10:04:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 191. [2025-02-08 10:04:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 180 states have internal predecessors, (239), 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-02-08 10:04:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 261 transitions. [2025-02-08 10:04:54,657 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 261 transitions. Word has length 13 [2025-02-08 10:04:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:54,657 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 261 transitions. [2025-02-08 10:04:54,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-02-08 10:04:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 261 transitions. [2025-02-08 10:04:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 10:04:54,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:54,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:54,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 10:04:54,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:54,862 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-02-08 10:04:54,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:54,863 INFO L85 PathProgramCache]: Analyzing trace with hash -843364887, now seen corresponding path program 1 times [2025-02-08 10:04:54,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:54,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-02-08 10:04:54,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:54,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:54,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 10:04:54,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 10:04:54,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:54,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:54,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135840197] [2025-02-08 10:04:54,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:54,889 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:54,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 10:04:55,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 10:04:55,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 10:04:55,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:55,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:55,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-08 10:04:55,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:55,053 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-02-08 10:04:55,064 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-02-08 10:04:55,092 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-02-08 10:04:55,096 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-02-08 10:04:55,106 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-02-08 10:04:55,229 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-02-08 10:04:55,234 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-02-08 10:04:55,287 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-02-08 10:04:55,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 10:04:55,457 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-02-08 10:04:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:55,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-02-08 10:04:55,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135840197] [2025-02-08 10:04:55,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135840197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:55,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:55,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:04:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649276162] [2025-02-08 10:04:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:55,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 10:04:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:55,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 10:04:55,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:04:55,546 INFO L87 Difference]: Start difference. First operand 191 states and 261 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-02-08 10:04:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:56,009 INFO L93 Difference]: Finished difference Result 225 states and 264 transitions. [2025-02-08 10:04:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:04:56,009 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-02-08 10:04:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:56,010 INFO L225 Difference]: With dead ends: 225 [2025-02-08 10:04:56,010 INFO L226 Difference]: Without dead ends: 224 [2025-02-08 10:04:56,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-02-08 10:04:56,011 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 175 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:56,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 778 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:04:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-08 10:04:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 191. [2025-02-08 10:04:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.762962962962963) internal successors, (238), 180 states have internal predecessors, (238), 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-02-08 10:04:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 260 transitions. [2025-02-08 10:04:56,018 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 260 transitions. Word has length 14 [2025-02-08 10:04:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:56,018 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 260 transitions. [2025-02-08 10:04:56,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-02-08 10:04:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 260 transitions. [2025-02-08 10:04:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 10:04:56,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:56,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:56,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 10:04:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 10:04:56,220 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-02-08 10:04:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1152371008, now seen corresponding path program 1 times [2025-02-08 10:04:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-02-08 10:04:56,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:56,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 10:04:56,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 10:04:56,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:56,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-02-08 10:04:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549453840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858980362] [2025-02-08 10:04:56,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:56,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:56,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:56,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:56,507 INFO L87 Difference]: Start difference. First operand 191 states and 260 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:04:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:56,633 INFO L93 Difference]: Finished difference Result 268 states and 353 transitions. [2025-02-08 10:04:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-08 10:04:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:56,635 INFO L225 Difference]: With dead ends: 268 [2025-02-08 10:04:56,636 INFO L226 Difference]: Without dead ends: 267 [2025-02-08 10:04:56,636 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-02-08 10:04:56,638 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 122 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 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-02-08 10:04:56,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 582 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-08 10:04:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 229. [2025-02-08 10:04:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 168 states have (on average 1.7619047619047619) internal successors, (296), 215 states have internal predecessors, (296), 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-02-08 10:04:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 330 transitions. [2025-02-08 10:04:56,651 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 330 transitions. Word has length 25 [2025-02-08 10:04:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:56,651 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 330 transitions. [2025-02-08 10:04:56,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:04:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 330 transitions. [2025-02-08 10:04:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 10:04:56,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:56,653 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-02-08 10:04:56,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:04:56,653 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-02-08 10:04:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1362872419, now seen corresponding path program 1 times [2025-02-08 10:04:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-02-08 10:04:56,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:56,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:04:56,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:04:56,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:56,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:56,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-02-08 10:04:56,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:56,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-02-08 10:04:56,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321100360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:56,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:04:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335846483] [2025-02-08 10:04:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:04:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:56,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:04:56,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:04:56,908 INFO L87 Difference]: Start difference. First operand 229 states and 330 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-02-08 10:04:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:57,071 INFO L93 Difference]: Finished difference Result 269 states and 392 transitions. [2025-02-08 10:04:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:04:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2025-02-08 10:04:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:57,073 INFO L225 Difference]: With dead ends: 269 [2025-02-08 10:04:57,073 INFO L226 Difference]: Without dead ends: 252 [2025-02-08 10:04:57,074 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-02-08 10:04:57,074 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 123 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:57,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 491 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-08 10:04:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2025-02-08 10:04:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 171 states have (on average 1.7543859649122806) internal successors, (300), 221 states have internal predecessors, (300), 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-02-08 10:04:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 345 transitions. [2025-02-08 10:04:57,087 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 345 transitions. Word has length 26 [2025-02-08 10:04:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:57,087 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 345 transitions. [2025-02-08 10:04:57,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-02-08 10:04:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 345 transitions. [2025-02-08 10:04:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 10:04:57,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:57,087 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-02-08 10:04:57,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:04:57,088 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-02-08 10:04:57,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1363762881, now seen corresponding path program 1 times [2025-02-08 10:04:57,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:57,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415318467] [2025-02-08 10:04:57,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:57,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:04:57,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:04:57,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:57,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415318467] [2025-02-08 10:04:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415318467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:57,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:57,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148160969] [2025-02-08 10:04:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:57,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:57,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:57,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:57,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:57,314 INFO L87 Difference]: Start difference. First operand 235 states and 345 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-02-08 10:04:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:57,429 INFO L93 Difference]: Finished difference Result 273 states and 365 transitions. [2025-02-08 10:04:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:57,429 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-02-08 10:04:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:57,431 INFO L225 Difference]: With dead ends: 273 [2025-02-08 10:04:57,431 INFO L226 Difference]: Without dead ends: 272 [2025-02-08 10:04:57,431 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-02-08 10:04:57,431 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 119 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 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-02-08 10:04:57,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 585 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-08 10:04:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 235. [2025-02-08 10:04:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 171 states have (on average 1.736842105263158) internal successors, (297), 221 states have internal predecessors, (297), 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-02-08 10:04:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 342 transitions. [2025-02-08 10:04:57,442 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 342 transitions. Word has length 26 [2025-02-08 10:04:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:57,442 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 342 transitions. [2025-02-08 10:04:57,442 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-02-08 10:04:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 342 transitions. [2025-02-08 10:04:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 10:04:57,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:57,443 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-02-08 10:04:57,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:04:57,443 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-02-08 10:04:57,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1391501570, now seen corresponding path program 1 times [2025-02-08 10:04:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:57,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275082785] [2025-02-08 10:04:57,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:57,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:04:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:04:57,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:57,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180717887] [2025-02-08 10:04:57,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:57,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:57,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:57,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 10:04:57,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:04:57,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:04:57,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:57,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:57,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 10:04:57,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:57,544 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-02-08 10:04:57,549 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-02-08 10:04:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:57,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:57,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275082785] [2025-02-08 10:04:57,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180717887] [2025-02-08 10:04:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180717887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:57,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:57,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 10:04:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879119106] [2025-02-08 10:04:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:57,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:04:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:57,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:04:57,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:04:57,639 INFO L87 Difference]: Start difference. First operand 235 states and 342 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-02-08 10:04:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:57,799 INFO L93 Difference]: Finished difference Result 479 states and 757 transitions. [2025-02-08 10:04:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:04:57,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2025-02-08 10:04:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:57,801 INFO L225 Difference]: With dead ends: 479 [2025-02-08 10:04:57,801 INFO L226 Difference]: Without dead ends: 263 [2025-02-08 10:04:57,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 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-02-08 10:04:57,803 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 100 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:57,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 537 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-08 10:04:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2025-02-08 10:04:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 182 states have (on average 1.6813186813186813) internal successors, (306), 234 states have internal predecessors, (306), 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-02-08 10:04:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2025-02-08 10:04:57,817 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 26 [2025-02-08 10:04:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:57,817 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2025-02-08 10:04:57,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-02-08 10:04:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2025-02-08 10:04:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 10:04:57,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:57,818 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-02-08 10:04:57,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 10:04:58,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:58,022 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-02-08 10:04:58,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -673023650, now seen corresponding path program 1 times [2025-02-08 10:04:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:58,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978016744] [2025-02-08 10:04:58,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:58,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 10:04:58,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 10:04:58,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:58,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:58,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:58,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978016744] [2025-02-08 10:04:58,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978016744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:58,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:58,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:58,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24296940] [2025-02-08 10:04:58,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:58,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:58,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:58,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:58,240 INFO L87 Difference]: Start difference. First operand 254 states and 385 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-02-08 10:04:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:58,380 INFO L93 Difference]: Finished difference Result 344 states and 507 transitions. [2025-02-08 10:04:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:58,380 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-02-08 10:04:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:58,382 INFO L225 Difference]: With dead ends: 344 [2025-02-08 10:04:58,382 INFO L226 Difference]: Without dead ends: 343 [2025-02-08 10:04:58,382 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-02-08 10:04:58,382 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 126 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 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-02-08 10:04:58,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 585 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-08 10:04:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 297. [2025-02-08 10:04:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 218 states have (on average 1.68348623853211) internal successors, (367), 273 states have internal predecessors, (367), 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-02-08 10:04:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 470 transitions. [2025-02-08 10:04:58,403 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 470 transitions. Word has length 27 [2025-02-08 10:04:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:58,403 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 470 transitions. [2025-02-08 10:04:58,403 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-02-08 10:04:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 470 transitions. [2025-02-08 10:04:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 10:04:58,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:58,404 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-02-08 10:04:58,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 10:04:58,404 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-02-08 10:04:58,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash -671270242, now seen corresponding path program 1 times [2025-02-08 10:04:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967945951] [2025-02-08 10:04:58,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:58,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 10:04:58,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 10:04:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967945951] [2025-02-08 10:04:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967945951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961421627] [2025-02-08 10:04:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:58,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:58,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:58,550 INFO L87 Difference]: Start difference. First operand 297 states and 470 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-02-08 10:04:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:58,671 INFO L93 Difference]: Finished difference Result 368 states and 555 transitions. [2025-02-08 10:04:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:58,671 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-02-08 10:04:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:58,673 INFO L225 Difference]: With dead ends: 368 [2025-02-08 10:04:58,673 INFO L226 Difference]: Without dead ends: 367 [2025-02-08 10:04:58,673 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-02-08 10:04:58,673 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 616 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-02-08 10:04:58,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 616 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-08 10:04:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2025-02-08 10:04:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 249 states have (on average 1.6827309236947792) internal successors, (419), 306 states have internal predecessors, (419), 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-02-08 10:04:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 533 transitions. [2025-02-08 10:04:58,690 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 533 transitions. Word has length 27 [2025-02-08 10:04:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:58,690 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 533 transitions. [2025-02-08 10:04:58,690 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-02-08 10:04:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 533 transitions. [2025-02-08 10:04:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:04:58,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:58,691 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-02-08 10:04:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 10:04:58,691 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-02-08 10:04:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash 611103327, now seen corresponding path program 1 times [2025-02-08 10:04:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953864191] [2025-02-08 10:04:58,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:58,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:04:58,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:04:58,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:58,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953864191] [2025-02-08 10:04:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953864191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:58,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980566792] [2025-02-08 10:04:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:58,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:58,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:58,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:58,853 INFO L87 Difference]: Start difference. First operand 334 states and 533 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-02-08 10:04:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:58,972 INFO L93 Difference]: Finished difference Result 380 states and 567 transitions. [2025-02-08 10:04:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:58,972 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-02-08 10:04:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:58,974 INFO L225 Difference]: With dead ends: 380 [2025-02-08 10:04:58,974 INFO L226 Difference]: Without dead ends: 379 [2025-02-08 10:04:58,974 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-02-08 10:04:58,974 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 123 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 588 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-02-08 10:04:58,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 588 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-02-08 10:04:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 334. [2025-02-08 10:04:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 249 states have (on average 1.6706827309236947) internal successors, (416), 306 states have internal predecessors, (416), 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-02-08 10:04:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 530 transitions. [2025-02-08 10:04:58,991 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 530 transitions. Word has length 28 [2025-02-08 10:04:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:58,991 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 530 transitions. [2025-02-08 10:04:58,991 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-02-08 10:04:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 530 transitions. [2025-02-08 10:04:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:04:58,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:58,992 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-02-08 10:04:58,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 10:04:58,992 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-02-08 10:04:58,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash 665458992, now seen corresponding path program 1 times [2025-02-08 10:04:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277057884] [2025-02-08 10:04:58,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:59,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:04:59,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:04:59,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:59,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:59,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:59,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277057884] [2025-02-08 10:04:59,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277057884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:59,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:59,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:59,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875925356] [2025-02-08 10:04:59,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:59,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:59,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:59,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:59,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:59,112 INFO L87 Difference]: Start difference. First operand 334 states and 530 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-02-08 10:04:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:59,253 INFO L93 Difference]: Finished difference Result 456 states and 709 transitions. [2025-02-08 10:04:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:59,253 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-02-08 10:04:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:59,255 INFO L225 Difference]: With dead ends: 456 [2025-02-08 10:04:59,255 INFO L226 Difference]: Without dead ends: 451 [2025-02-08 10:04:59,255 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-02-08 10:04:59,256 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 117 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:59,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 603 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-08 10:04:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 409. [2025-02-08 10:04:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 312 states have (on average 1.6762820512820513) internal successors, (523), 373 states have internal predecessors, (523), 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-02-08 10:04:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 674 transitions. [2025-02-08 10:04:59,281 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 674 transitions. Word has length 28 [2025-02-08 10:04:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:59,282 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 674 transitions. [2025-02-08 10:04:59,282 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-02-08 10:04:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 674 transitions. [2025-02-08 10:04:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:04:59,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:59,282 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-02-08 10:04:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 10:04:59,282 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-02-08 10:04:59,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1764333948, now seen corresponding path program 1 times [2025-02-08 10:04:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287854478] [2025-02-08 10:04:59,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:59,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:04:59,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:04:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:59,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:59,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:59,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287854478] [2025-02-08 10:04:59,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287854478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:59,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:59,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:04:59,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618006511] [2025-02-08 10:04:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:59,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:04:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:59,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:04:59,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:04:59,411 INFO L87 Difference]: Start difference. First operand 409 states and 674 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 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-02-08 10:04:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:59,516 INFO L93 Difference]: Finished difference Result 538 states and 849 transitions. [2025-02-08 10:04:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:04:59,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 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-02-08 10:04:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:59,519 INFO L225 Difference]: With dead ends: 538 [2025-02-08 10:04:59,519 INFO L226 Difference]: Without dead ends: 536 [2025-02-08 10:04:59,519 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-02-08 10:04:59,520 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 177 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 549 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-02-08 10:04:59,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 549 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-08 10:04:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 485. [2025-02-08 10:04:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 379 states have (on average 1.6781002638522426) internal successors, (636), 444 states have internal predecessors, (636), 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-02-08 10:04:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 826 transitions. [2025-02-08 10:04:59,542 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 826 transitions. Word has length 29 [2025-02-08 10:04:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:59,542 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 826 transitions. [2025-02-08 10:04:59,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 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-02-08 10:04:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 826 transitions. [2025-02-08 10:04:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:04:59,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:59,543 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-02-08 10:04:59,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 10:04:59,543 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-02-08 10:04:59,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash -845607716, now seen corresponding path program 1 times [2025-02-08 10:04:59,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:59,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938783025] [2025-02-08 10:04:59,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:59,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:59,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:04:59,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:04:59,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:59,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938783025] [2025-02-08 10:04:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938783025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:59,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:04:59,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037053823] [2025-02-08 10:04:59,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:59,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:04:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:59,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:04:59,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:04:59,776 INFO L87 Difference]: Start difference. First operand 485 states and 826 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:04:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:59,841 INFO L93 Difference]: Finished difference Result 1016 states and 1942 transitions. [2025-02-08 10:04:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:04:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 10:04:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:59,844 INFO L225 Difference]: With dead ends: 1016 [2025-02-08 10:04:59,844 INFO L226 Difference]: Without dead ends: 589 [2025-02-08 10:04:59,847 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-02-08 10:04:59,848 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 54 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:59,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:04:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-08 10:04:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 506. [2025-02-08 10:04:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 400 states have (on average 1.665) internal successors, (666), 465 states have internal predecessors, (666), 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-02-08 10:04:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 856 transitions. [2025-02-08 10:04:59,875 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 856 transitions. Word has length 29 [2025-02-08 10:04:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:59,875 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 856 transitions. [2025-02-08 10:04:59,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:04:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 856 transitions. [2025-02-08 10:04:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:04:59,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:59,876 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-02-08 10:04:59,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 10:04:59,876 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-02-08 10:04:59,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -843422019, now seen corresponding path program 1 times [2025-02-08 10:04:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590532791] [2025-02-08 10:04:59,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:59,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:04:59,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:04:59,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:59,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:00,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:00,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590532791] [2025-02-08 10:05:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590532791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:00,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425170541] [2025-02-08 10:05:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:00,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:00,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:00,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:00,008 INFO L87 Difference]: Start difference. First operand 506 states and 856 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-02-08 10:05:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:00,131 INFO L93 Difference]: Finished difference Result 536 states and 873 transitions. [2025-02-08 10:05:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:00,132 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-02-08 10:05:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:00,134 INFO L225 Difference]: With dead ends: 536 [2025-02-08 10:05:00,134 INFO L226 Difference]: Without dead ends: 535 [2025-02-08 10:05:00,134 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-02-08 10:05:00,134 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 92 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:00,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 611 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-08 10:05:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 507. [2025-02-08 10:05:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.660847880299252) internal successors, (666), 466 states have internal predecessors, (666), 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-02-08 10:05:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 856 transitions. [2025-02-08 10:05:00,158 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 856 transitions. Word has length 29 [2025-02-08 10:05:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:00,158 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 856 transitions. [2025-02-08 10:05:00,158 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-02-08 10:05:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 856 transitions. [2025-02-08 10:05:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:05:00,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:00,159 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-02-08 10:05:00,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 10:05:00,159 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-02-08 10:05:00,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash -843422819, now seen corresponding path program 1 times [2025-02-08 10:05:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:00,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317678182] [2025-02-08 10:05:00,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:00,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:00,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:00,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:00,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:00,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:00,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317678182] [2025-02-08 10:05:00,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317678182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:00,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:00,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119284854] [2025-02-08 10:05:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:00,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:00,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:00,300 INFO L87 Difference]: Start difference. First operand 507 states and 856 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-02-08 10:05:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:00,428 INFO L93 Difference]: Finished difference Result 547 states and 884 transitions. [2025-02-08 10:05:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:00,428 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-02-08 10:05:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:00,430 INFO L225 Difference]: With dead ends: 547 [2025-02-08 10:05:00,431 INFO L226 Difference]: Without dead ends: 546 [2025-02-08 10:05:00,431 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-02-08 10:05:00,431 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 110 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:00,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 606 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-02-08 10:05:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 512. [2025-02-08 10:05:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 406 states have (on average 1.6551724137931034) internal successors, (672), 471 states have internal predecessors, (672), 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-02-08 10:05:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 862 transitions. [2025-02-08 10:05:00,454 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 862 transitions. Word has length 29 [2025-02-08 10:05:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:00,454 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 862 transitions. [2025-02-08 10:05:00,454 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-02-08 10:05:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 862 transitions. [2025-02-08 10:05:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:05:00,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:00,455 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-02-08 10:05:00,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 10:05:00,455 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-02-08 10:05:00,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 41895965, now seen corresponding path program 1 times [2025-02-08 10:05:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060973946] [2025-02-08 10:05:00,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:00,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:00,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:00,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:00,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:00,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081756018] [2025-02-08 10:05:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:00,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:00,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 10:05:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:00,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:00,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:00,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:00,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 10:05:00,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:00,620 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-02-08 10:05:00,624 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-02-08 10:05:00,632 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-02-08 10:05:00,754 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-02-08 10:05:00,757 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-02-08 10:05:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:00,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:00,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:00,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060973946] [2025-02-08 10:05:00,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:00,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081756018] [2025-02-08 10:05:00,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081756018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:00,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:00,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:00,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599625814] [2025-02-08 10:05:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:00,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:00,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:00,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:00,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:00,768 INFO L87 Difference]: Start difference. First operand 512 states and 862 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-02-08 10:05:04,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 10:05:08,886 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-02-08 10:05:12,897 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-02-08 10:05:16,918 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-02-08 10:05:20,971 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-02-08 10:05:24,983 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-02-08 10:05:28,990 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-02-08 10:05:33,007 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-02-08 10:05:37,012 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-02-08 10:05:41,020 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-02-08 10:05:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:41,101 INFO L93 Difference]: Finished difference Result 565 states and 901 transitions. [2025-02-08 10:05:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:05:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-02-08 10:05:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:41,104 INFO L225 Difference]: With dead ends: 565 [2025-02-08 10:05:41,104 INFO L226 Difference]: Without dead ends: 564 [2025-02-08 10:05:41,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 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-02-08 10:05:41,108 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 172 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:41,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 572 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 40.2s Time] [2025-02-08 10:05:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-08 10:05:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 525. [2025-02-08 10:05:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.6394230769230769) internal successors, (682), 480 states have internal predecessors, (682), 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-02-08 10:05:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 874 transitions. [2025-02-08 10:05:41,135 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 874 transitions. Word has length 29 [2025-02-08 10:05:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:41,135 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 874 transitions. [2025-02-08 10:05:41,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-02-08 10:05:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 874 transitions. [2025-02-08 10:05:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:05:41,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:41,136 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-02-08 10:05:41,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 10:05:41,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:41,338 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-02-08 10:05:41,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -376278761, now seen corresponding path program 1 times [2025-02-08 10:05:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:41,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227256101] [2025-02-08 10:05:41,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:41,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:41,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:41,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:41,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227256101] [2025-02-08 10:05:41,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227256101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:41,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:41,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:41,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729914105] [2025-02-08 10:05:41,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:41,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:41,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:41,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:41,608 INFO L87 Difference]: Start difference. First operand 525 states and 874 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-02-08 10:05:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:41,750 INFO L93 Difference]: Finished difference Result 618 states and 993 transitions. [2025-02-08 10:05:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:41,750 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-02-08 10:05:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:41,753 INFO L225 Difference]: With dead ends: 618 [2025-02-08 10:05:41,753 INFO L226 Difference]: Without dead ends: 617 [2025-02-08 10:05:41,753 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-02-08 10:05:41,753 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 139 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 636 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-02-08 10:05:41,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 636 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-02-08 10:05:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 577. [2025-02-08 10:05:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 461 states have (on average 1.648590021691974) internal successors, (760), 528 states have internal predecessors, (760), 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-02-08 10:05:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 975 transitions. [2025-02-08 10:05:41,779 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 975 transitions. Word has length 30 [2025-02-08 10:05:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 975 transitions. [2025-02-08 10:05:41,780 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-02-08 10:05:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 975 transitions. [2025-02-08 10:05:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:05:41,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:41,780 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-02-08 10:05:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 10:05:41,780 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-02-08 10:05:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -376303586, now seen corresponding path program 1 times [2025-02-08 10:05:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957422558] [2025-02-08 10:05:41,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:41,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:41,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:41,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:41,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957422558] [2025-02-08 10:05:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957422558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:41,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:41,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:41,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900011872] [2025-02-08 10:05:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:41,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:41,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:41,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:41,918 INFO L87 Difference]: Start difference. First operand 577 states and 975 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-02-08 10:05:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:42,052 INFO L93 Difference]: Finished difference Result 627 states and 1011 transitions. [2025-02-08 10:05:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:42,053 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-02-08 10:05:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:42,055 INFO L225 Difference]: With dead ends: 627 [2025-02-08 10:05:42,055 INFO L226 Difference]: Without dead ends: 626 [2025-02-08 10:05:42,055 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-02-08 10:05:42,056 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 129 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 638 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-02-08 10:05:42,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 638 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-02-08 10:05:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 577. [2025-02-08 10:05:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 461 states have (on average 1.6420824295010845) internal successors, (757), 528 states have internal predecessors, (757), 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-02-08 10:05:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 972 transitions. [2025-02-08 10:05:42,113 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 972 transitions. Word has length 30 [2025-02-08 10:05:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:42,113 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 972 transitions. [2025-02-08 10:05:42,114 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-02-08 10:05:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 972 transitions. [2025-02-08 10:05:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:05:42,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:42,114 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-02-08 10:05:42,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 10:05:42,114 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-02-08 10:05:42,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1298774925, now seen corresponding path program 1 times [2025-02-08 10:05:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530372692] [2025-02-08 10:05:42,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:42,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:42,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:42,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:42,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:42,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893064543] [2025-02-08 10:05:42,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:42,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:42,144 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:42,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 10:05:42,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:42,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:42,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:42,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:42,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 10:05:42,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:42,272 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-02-08 10:05:42,276 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-02-08 10:05:42,279 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