./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.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/loops-crafted-1/discover_list.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 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:12:15,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:12:15,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:12:15,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:12:15,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:12:15,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:12:15,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:12:15,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:12:15,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:12:15,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:12:15,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:12:15,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:12:15,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:12:15,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:12:15,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:12:15,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:12:15,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:12:15,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:12:15,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:12:15,293 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 -> 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 [2025-02-08 09:12:15,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:12:15,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:12:15,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:12:15,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:12:15,554 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:12:15,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-02-08 09:12:16,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4858963c8/a42d876742b34e0aa6b266265cc212a5/FLAG3e6a1b267 [2025-02-08 09:12:17,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:12:17,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-02-08 09:12:17,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4858963c8/a42d876742b34e0aa6b266265cc212a5/FLAG3e6a1b267 [2025-02-08 09:12:17,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4858963c8/a42d876742b34e0aa6b266265cc212a5 [2025-02-08 09:12:17,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:12:17,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:12:17,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:12:17,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:12:17,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:12:17,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106a80ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17, skipping insertion in model container [2025-02-08 09:12:17,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:12:17,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:12:17,551 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:12:17,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:12:17,631 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:12:17,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17 WrapperNode [2025-02-08 09:12:17,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:12:17,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:12:17,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:12:17,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:12:17,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,681 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 570 [2025-02-08 09:12:17,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:12:17,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:12:17,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:12:17,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:12:17,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,715 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 10, 12, 100, 42, 11, 4]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 0, 0, 97, 39, 11, 1]. [2025-02-08 09:12:17,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:12:17,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:12:17,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:12:17,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:12:17,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (1/1) ... [2025-02-08 09:12:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:12:17,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:17,792 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 09:12:17,797 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 09:12:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:12:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 09:12:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 09:12:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 09:12:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 09:12:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 09:12:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 09:12:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 09:12:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 09:12:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 09:12:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 09:12:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 09:12:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 09:12:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 09:12:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 09:12:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 09:12:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 09:12:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 09:12:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 09:12:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 09:12:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:12:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:12:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 09:12:17,932 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:12:17,933 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:12:22,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc do_discover_list_#t~mem100#1; [2025-02-08 09:12:22,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: call ULTIMATE.dealloc(do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset);havoc do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset;call ULTIMATE.dealloc(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset);havoc do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset; [2025-02-08 09:12:22,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L495: call ULTIMATE.dealloc(main_~#tobj~0#1.base, main_~#tobj~0#1.offset);havoc main_~#tobj~0#1.base, main_~#tobj~0#1.offset;call ULTIMATE.dealloc(main_~#opts~0#1.base, main_~#opts~0#1.offset);havoc main_~#opts~0#1.base, main_~#opts~0#1.offset; [2025-02-08 09:12:22,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc smp_send_req_#t~nondet4#1; [2025-02-08 09:12:22,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: do_discover_list_#t~ret91#1 := smp_get_func_def_resp_len_#res#1;havoc smp_get_func_def_resp_len_#t~mem5#1, smp_get_func_def_resp_len_#t~mem6#1, smp_get_func_def_resp_len_#t~mem7#1, smp_get_func_def_resp_len_#t~pre8#1.base, smp_get_func_def_resp_len_#t~pre8#1.offset, smp_get_func_def_resp_len_~func_code#1, smp_get_func_def_resp_len_~drlp~0#1.base, smp_get_func_def_resp_len_~drlp~0#1.offset;havoc smp_get_func_def_resp_len_#in~func_code#1;assume { :end_inline_smp_get_func_def_resp_len } true;assume -2147483648 <= do_discover_list_#t~ret91#1 && do_discover_list_#t~ret91#1 <= 2147483647;do_discover_list_~len~2#1 := do_discover_list_#t~ret91#1;havoc do_discover_list_#t~mem90#1;havoc do_discover_list_#t~ret91#1; [2025-02-08 09:12:22,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc do_discover_list_#t~mem105#1; [2025-02-08 09:12:22,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume do_discover_list_~len~2#1 < 0;do_discover_list_~len~2#1 := 0; [2025-02-08 09:12:22,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume !(do_discover_list_~len~2#1 < 0); [2025-02-08 09:12:22,678 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2025-02-08 09:12:22,678 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:12:22,695 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:12:22,696 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:12:22,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:12:22 BoogieIcfgContainer [2025-02-08 09:12:22,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:12:22,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:12:22,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:12:22,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:12:22,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:12:17" (1/3) ... [2025-02-08 09:12:22,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f75f640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:12:22, skipping insertion in model container [2025-02-08 09:12:22,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:17" (2/3) ... [2025-02-08 09:12:22,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f75f640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:12:22, skipping insertion in model container [2025-02-08 09:12:22,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:12:22" (3/3) ... [2025-02-08 09:12:22,703 INFO L128 eAbstractionObserver]: Analyzing ICFG discover_list.c [2025-02-08 09:12:22,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:12:22,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG discover_list.c that has 9 procedures, 184 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-02-08 09:12:22,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:12:22,766 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;@7fc19cea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:12:22,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-08 09:12:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 108 states have (on average 1.75) internal successors, (189), 152 states have internal predecessors, (189), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 09:12:22,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:22,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 09:12:22,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:22,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash 9248, now seen corresponding path program 1 times [2025-02-08 09:12:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224380875] [2025-02-08 09:12:22,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:22,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:23,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 09:12:23,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 09:12:23,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:23,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:23,982 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 09:12:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:23,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224380875] [2025-02-08 09:12:23,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224380875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:23,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:23,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:12:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281352218] [2025-02-08 09:12:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:24,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:24,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:24,005 INFO L87 Difference]: Start difference. First operand has 164 states, 108 states have (on average 1.75) internal successors, (189), 152 states have internal predecessors, (189), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:24,062 INFO L93 Difference]: Finished difference Result 311 states and 393 transitions. [2025-02-08 09:12:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:24,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 09:12:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:24,067 INFO L225 Difference]: With dead ends: 311 [2025-02-08 09:12:24,067 INFO L226 Difference]: Without dead ends: 143 [2025-02-08 09:12:24,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:24,073 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:24,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 384 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-08 09:12:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-08 09:12:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 92 states have (on average 1.641304347826087) internal successors, (151), 131 states have internal predecessors, (151), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2025-02-08 09:12:24,108 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 2 [2025-02-08 09:12:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:24,109 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2025-02-08 09:12:24,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2025-02-08 09:12:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 09:12:24,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:24,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 09:12:24,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:12:24,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:24,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash 286913, now seen corresponding path program 1 times [2025-02-08 09:12:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:24,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124679604] [2025-02-08 09:12:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:24,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 09:12:24,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 09:12:24,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:24,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:24,949 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 09:12:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:24,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124679604] [2025-02-08 09:12:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124679604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:12:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273968942] [2025-02-08 09:12:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:24,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:24,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:24,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:24,952 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:24,967 INFO L93 Difference]: Finished difference Result 143 states and 167 transitions. [2025-02-08 09:12:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 09:12:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:24,968 INFO L225 Difference]: With dead ends: 143 [2025-02-08 09:12:24,968 INFO L226 Difference]: Without dead ends: 141 [2025-02-08 09:12:24,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:24,969 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 2 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:24,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-08 09:12:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-08 09:12:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 129 states have internal predecessors, (149), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2025-02-08 09:12:24,977 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 3 [2025-02-08 09:12:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:24,978 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2025-02-08 09:12:24,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2025-02-08 09:12:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 09:12:24,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:24,978 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 09:12:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:12:24,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:24,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2082118982, now seen corresponding path program 1 times [2025-02-08 09:12:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500326608] [2025-02-08 09:12:24,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:25,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 09:12:25,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 09:12:25,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:25,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:25,873 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 09:12:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500326608] [2025-02-08 09:12:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500326608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:25,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 09:12:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166694] [2025-02-08 09:12:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:25,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:12:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:25,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:12:25,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:25,874 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:12:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:26,471 INFO L93 Difference]: Finished difference Result 302 states and 355 transitions. [2025-02-08 09:12:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:12:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 09:12:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:26,473 INFO L225 Difference]: With dead ends: 302 [2025-02-08 09:12:26,474 INFO L226 Difference]: Without dead ends: 169 [2025-02-08 09:12:26,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:12:26,479 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 31 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:26,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 608 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 09:12:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-08 09:12:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2025-02-08 09:12:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.6063829787234043) internal successors, (151), 131 states have internal predecessors, (151), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2025-02-08 09:12:26,494 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 25 [2025-02-08 09:12:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:26,494 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2025-02-08 09:12:26,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:12:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2025-02-08 09:12:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 09:12:26,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:26,495 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 09:12:26,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:12:26,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1215775961, now seen corresponding path program 1 times [2025-02-08 09:12:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853566229] [2025-02-08 09:12:26,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:27,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 09:12:27,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 09:12:27,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:27,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:27,224 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 09:12:27,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853566229] [2025-02-08 09:12:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853566229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:12:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445334972] [2025-02-08 09:12:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:27,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:12:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:27,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:12:27,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:12:27,226 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:12:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:28,138 INFO L93 Difference]: Finished difference Result 143 states and 167 transitions. [2025-02-08 09:12:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:12:28,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 09:12:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:28,140 INFO L225 Difference]: With dead ends: 143 [2025-02-08 09:12:28,140 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 09:12:28,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:12:28,140 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 9 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:28,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 450 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 09:12:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 09:12:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-08 09:12:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.5638297872340425) internal successors, (147), 127 states have internal predecessors, (147), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2025-02-08 09:12:28,149 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 25 [2025-02-08 09:12:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:28,149 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2025-02-08 09:12:28,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:12:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2025-02-08 09:12:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 09:12:28,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:28,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:28,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:12:28,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:28,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:28,150 INFO L85 PathProgramCache]: Analyzing trace with hash -338681562, now seen corresponding path program 1 times [2025-02-08 09:12:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:28,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069113148] [2025-02-08 09:12:28,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:28,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 09:12:28,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 09:12:28,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:28,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:29,037 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 09:12:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069113148] [2025-02-08 09:12:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069113148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:29,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 09:12:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599651399] [2025-02-08 09:12:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:12:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:29,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:12:29,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:29,038 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:12:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:29,303 INFO L93 Difference]: Finished difference Result 243 states and 283 transitions. [2025-02-08 09:12:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:12:29,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-02-08 09:12:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:29,307 INFO L225 Difference]: With dead ends: 243 [2025-02-08 09:12:29,307 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 09:12:29,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:29,308 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:29,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 462 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:12:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 09:12:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-08 09:12:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.553191489361702) internal successors, (146), 127 states have internal predecessors, (146), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2025-02-08 09:12:29,320 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 41 [2025-02-08 09:12:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:29,321 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2025-02-08 09:12:29,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:12:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2025-02-08 09:12:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 09:12:29,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:29,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:29,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:12:29,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash -632084569, now seen corresponding path program 1 times [2025-02-08 09:12:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146644365] [2025-02-08 09:12:29,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:29,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 09:12:30,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 09:12:30,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:30,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:30,189 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 09:12:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146644365] [2025-02-08 09:12:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146644365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:12:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366071357] [2025-02-08 09:12:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:30,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:12:30,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:30,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:12:30,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:12:30,191 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:12:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:30,204 INFO L93 Difference]: Finished difference Result 259 states and 301 transitions. [2025-02-08 09:12:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:12:30,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-02-08 09:12:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:30,205 INFO L225 Difference]: With dead ends: 259 [2025-02-08 09:12:30,207 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 09:12:30,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:12:30,208 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:30,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 09:12:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-08 09:12:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 128 states have internal predecessors, (147), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2025-02-08 09:12:30,218 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 41 [2025-02-08 09:12:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:30,218 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2025-02-08 09:12:30,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:12:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2025-02-08 09:12:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 09:12:30,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:30,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:30,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:12:30,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash -483268091, now seen corresponding path program 1 times [2025-02-08 09:12:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431750797] [2025-02-08 09:12:30,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:30,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 09:12:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 09:12:30,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:30,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431750797] [2025-02-08 09:12:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431750797] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970155145] [2025-02-08 09:12:31,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:31,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:31,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:31,101 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 09:12:31,101 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 09:12:31,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 09:12:32,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 09:12:32,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:32,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:32,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 09:12:32,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:32,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:12:32,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970155145] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:32,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:12:32,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2025-02-08 09:12:32,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901469136] [2025-02-08 09:12:32,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:32,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:12:32,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:32,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:12:32,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:12:32,161 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:12:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:32,178 INFO L93 Difference]: Finished difference Result 243 states and 283 transitions. [2025-02-08 09:12:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:12:32,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-02-08 09:12:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:32,179 INFO L225 Difference]: With dead ends: 243 [2025-02-08 09:12:32,179 INFO L226 Difference]: Without dead ends: 141 [2025-02-08 09:12:32,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:12:32,180 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:32,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-08 09:12:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-08 09:12:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 129 states have internal predecessors, (148), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2025-02-08 09:12:32,193 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 42 [2025-02-08 09:12:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:32,193 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2025-02-08 09:12:32,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:12:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2025-02-08 09:12:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 09:12:32,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:32,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:32,209 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 09:12:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:32,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:32,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash -505335809, now seen corresponding path program 1 times [2025-02-08 09:12:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531493818] [2025-02-08 09:12:32,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:33,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 09:12:33,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 09:12:33,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:33,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:12:33,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:33,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531493818] [2025-02-08 09:12:33,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531493818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:33,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315505536] [2025-02-08 09:12:33,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:33,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:33,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:33,529 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 09:12:33,536 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 09:12:34,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 09:12:34,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 09:12:34,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:34,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:34,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 09:12:34,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:34,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:12:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315505536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:34,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2025-02-08 09:12:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436974066] [2025-02-08 09:12:34,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 09:12:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:34,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 09:12:34,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:12:34,530 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 09:12:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:34,630 INFO L93 Difference]: Finished difference Result 269 states and 316 transitions. [2025-02-08 09:12:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 09:12:34,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-02-08 09:12:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:34,632 INFO L225 Difference]: With dead ends: 269 [2025-02-08 09:12:34,633 INFO L226 Difference]: Without dead ends: 145 [2025-02-08 09:12:34,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:12:34,634 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:34,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1076 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-08 09:12:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-08 09:12:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.52) internal successors, (152), 133 states have internal predecessors, (152), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:12:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2025-02-08 09:12:34,640 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 43 [2025-02-08 09:12:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:34,641 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2025-02-08 09:12:34,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 09:12:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2025-02-08 09:12:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 09:12:34,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:34,643 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:34,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:34,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:12:34,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 910336231, now seen corresponding path program 2 times [2025-02-08 09:12:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275480216] [2025-02-08 09:12:34,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:35,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-08 09:12:35,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 09:12:35,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:35,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 09:12:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275480216] [2025-02-08 09:12:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275480216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925336835] [2025-02-08 09:12:35,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:35,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:35,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:35,992 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 09:12:35,993 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 09:12:36,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-08 09:13:55,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 09:13:55,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:13:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:13:55,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 09:13:55,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:13:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 09:13:55,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:13:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 09:13:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925336835] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:13:55,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:13:55,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 18 [2025-02-08 09:13:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549421946] [2025-02-08 09:13:55,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:13:55,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 09:13:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:13:55,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 09:13:55,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-02-08 09:13:55,816 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 09:13:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:13:56,063 INFO L93 Difference]: Finished difference Result 279 states and 329 transitions. [2025-02-08 09:13:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 09:13:56,064 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-02-08 09:13:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:13:56,065 INFO L225 Difference]: With dead ends: 279 [2025-02-08 09:13:56,065 INFO L226 Difference]: Without dead ends: 152 [2025-02-08 09:13:56,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2025-02-08 09:13:56,065 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:13:56,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1689 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:13:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-08 09:13:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-08 09:13:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 107 states have (on average 1.485981308411215) internal successors, (159), 140 states have internal predecessors, (159), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:13:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2025-02-08 09:13:56,071 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 47 [2025-02-08 09:13:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:13:56,071 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2025-02-08 09:13:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 09:13:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2025-02-08 09:13:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 09:13:56,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:13:56,072 INFO L218 NwaCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:13:56,093 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 09:13:56,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:13:56,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 09:13:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:13:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1809816955, now seen corresponding path program 3 times [2025-02-08 09:13:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:13:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158514156] [2025-02-08 09:13:56,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:13:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:13:57,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 6 equivalence classes. [2025-02-08 09:13:57,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 54 statements. [2025-02-08 09:13:57,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 09:13:57,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:13:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 09:13:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:13:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158514156] [2025-02-08 09:13:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158514156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:13:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208852662] [2025-02-08 09:13:57,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:13:57,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:13:57,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:13:57,617 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 09:13:57,618 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 09:13:58,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 6 equivalence classes.