./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/logname-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/logname-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash a1d3b316d503bafd24919c67f5c3ea44c9db1f709a53665a9b83874ae0ba729b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:26:20,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:26:21,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:26:21,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:26:21,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:26:21,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:26:21,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:26:21,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:26:21,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:26:21,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:26:21,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:26:21,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:26:21,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:26:21,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:26:21,071 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:26:21,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:26:21,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:26:21,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:26:21,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:26:21,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:26:21,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:26:21,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:26:21,072 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:26:21,072 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:26:21,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:26:21,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:26:21,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:26:21,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:26:21,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:26:21,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:26:21,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:26:21,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:21,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:26:21,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:26:21,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:26:21,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:26:21,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:26:21,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:26:21,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:26:21,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:26:21,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:26:21,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:26:21,074 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1d3b316d503bafd24919c67f5c3ea44c9db1f709a53665a9b83874ae0ba729b [2025-02-08 13:26:21,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:26:21,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:26:21,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:26:21,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:26:21,373 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:26:21,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-2.i [2025-02-08 13:26:22,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35c572a4/b7d9642e882e46b8a0dceec4c0a84505/FLAGf266835b1 [2025-02-08 13:26:23,148 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:26:23,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-2.i [2025-02-08 13:26:23,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35c572a4/b7d9642e882e46b8a0dceec4c0a84505/FLAGf266835b1 [2025-02-08 13:26:23,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35c572a4/b7d9642e882e46b8a0dceec4c0a84505 [2025-02-08 13:26:23,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:26:23,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:26:23,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:23,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:26:23,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:26:23,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:23" (1/1) ... [2025-02-08 13:26:23,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5126683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:23, skipping insertion in model container [2025-02-08 13:26:23,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:23" (1/1) ... [2025-02-08 13:26:23,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:26:24,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:24,183 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:26:24,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:24,415 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:26:24,422 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:26:24,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24 WrapperNode [2025-02-08 13:26:24,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:24,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:24,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:26:24,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:26:24,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,510 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 815 [2025-02-08 13:26:24,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:24,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:26:24,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:26:24,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:26:24,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,554 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:26:24,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:26:24,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:26:24,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:26:24,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:26:24,633 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (1/1) ... [2025-02-08 13:26:24,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:24,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:24,669 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 13:26:24,677 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 13:26:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:26:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:26:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:26:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:26:24,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:26:24,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:26:24,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-02-08 13:26:24,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-02-08 13:26:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:26:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:26:25,064 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:26:25,066 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:26:25,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2348: full_write_#t~ret106#1 := safe_write_#res#1;havoc safe_write_#t~ret112#1, safe_write_#t~mem113#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret106#1 && full_write_#t~ret106#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret106#1;havoc full_write_#t~ret106#1; [2025-02-08 13:26:25,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-02-08 13:26:25,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: assume full_write_~cc~0#1 < 0; [2025-02-08 13:26:25,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:26:25,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2383-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2383-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2351: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2351: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2385: safe_write_#t~ret112#1 := write_#res#1;havoc write_#t~nondet154#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~2#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret112#1 && safe_write_#t~ret112#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret112#1;havoc safe_write_#t~ret112#1; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem113#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem113#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2330: bb_verror_msg_#t~ret101#1 := full_write_#res#1;havoc full_write_#t~ret106#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret101#1 && bb_verror_msg_#t~ret101#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset;havoc bb_verror_msg_#t~ret101#1; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2355-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2355-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:26:25,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2355: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:26:25,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2355: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:26:25,867 INFO L? ?]: Removed 221 outVars from TransFormulas that were not future-live. [2025-02-08 13:26:25,869 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:26:25,889 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:26:25,889 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:26:25,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:25 BoogieIcfgContainer [2025-02-08 13:26:25,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:26:25,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:26:25,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:26:25,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:26:25,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:26:23" (1/3) ... [2025-02-08 13:26:25,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f1133c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:25, skipping insertion in model container [2025-02-08 13:26:25,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:24" (2/3) ... [2025-02-08 13:26:25,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f1133c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:25, skipping insertion in model container [2025-02-08 13:26:25,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:25" (3/3) ... [2025-02-08 13:26:25,900 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-2.i [2025-02-08 13:26:25,913 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:26:25,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-2.i that has 4 procedures, 162 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-02-08 13:26:25,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:26:25,993 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;@378dee9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:26:25,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-08 13:26:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 101 states have (on average 1.702970297029703) internal successors, (172), 148 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 13:26:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:26:26,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:26,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:26:26,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash 242260, now seen corresponding path program 1 times [2025-02-08 13:26:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:26,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949478769] [2025-02-08 13:26:26,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:26,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:26:26,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:26:26,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:26,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:26,712 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 13:26:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949478769] [2025-02-08 13:26:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949478769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:26,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:26,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:26:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924498210] [2025-02-08 13:26:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:26,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:26,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:26,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:26,741 INFO L87 Difference]: Start difference. First operand has 162 states, 101 states have (on average 1.702970297029703) internal successors, (172), 148 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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 13:26:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:26,791 INFO L93 Difference]: Finished difference Result 224 states and 274 transitions. [2025-02-08 13:26:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:26,794 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 13:26:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:26,801 INFO L225 Difference]: With dead ends: 224 [2025-02-08 13:26:26,802 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 13:26:26,806 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 13:26:26,810 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:26,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 13:26:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 13:26:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5) internal successors, (63), 55 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-02-08 13:26:26,858 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 3 [2025-02-08 13:26:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:26,860 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-02-08 13:26:26,860 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 13:26:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-02-08 13:26:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:26:26,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:26,861 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:26:26,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:26:26,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:26,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1372589059, now seen corresponding path program 1 times [2025-02-08 13:26:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:26,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711720535] [2025-02-08 13:26:26,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:26,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:26,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:26,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:26,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:27,185 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 13:26:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711720535] [2025-02-08 13:26:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711720535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639783956] [2025-02-08 13:26:27,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:27,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:27,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:27,190 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 13:26:27,192 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 13:26:27,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:27,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:27,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:27,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:27,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:27,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:27,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639783956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:26:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935022563] [2025-02-08 13:26:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:27,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:27,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:27,573 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:26:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:27,621 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2025-02-08 13:26:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:26:27,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 13:26:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:27,622 INFO L225 Difference]: With dead ends: 60 [2025-02-08 13:26:27,622 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 13:26:27,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:27,623 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:27,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 13:26:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 13:26:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-02-08 13:26:27,634 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 6 [2025-02-08 13:26:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:27,634 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-02-08 13:26:27,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:26:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-02-08 13:26:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:26:27,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:27,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:26:27,646 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 13:26:27,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:27,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:27,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 399412310, now seen corresponding path program 1 times [2025-02-08 13:26:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46231936] [2025-02-08 13:26:27,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:27,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:26:27,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:26:27,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:27,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:26:28,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46231936] [2025-02-08 13:26:28,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46231936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:28,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:28,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111650961] [2025-02-08 13:26:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:28,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:28,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:28,045 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 13:26:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:28,080 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-02-08 13:26:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:28,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-02-08 13:26:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:28,082 INFO L225 Difference]: With dead ends: 59 [2025-02-08 13:26:28,083 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 13:26:28,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:26:28,084 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:28,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 13:26:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-08 13:26:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.475) internal successors, (59), 51 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-02-08 13:26:28,096 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 7 [2025-02-08 13:26:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:28,096 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-02-08 13:26:28,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 13:26:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-02-08 13:26:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:26:28,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:28,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:28,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:26:28,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:28,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1309253941, now seen corresponding path program 1 times [2025-02-08 13:26:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:28,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569243298] [2025-02-08 13:26:28,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:28,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:28,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:28,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:28,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:28,380 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 13:26:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569243298] [2025-02-08 13:26:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569243298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:28,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505200839] [2025-02-08 13:26:28,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:28,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:28,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:28,384 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 13:26:28,386 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 13:26:28,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:28,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:28,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:28,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:28,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:28,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:28,713 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 13:26:28,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:28,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505200839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:28,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:28,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378805897] [2025-02-08 13:26:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:28,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:28,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:28,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:28,716 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 13:26:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:28,766 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2025-02-08 13:26:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:28,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2025-02-08 13:26:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:28,772 INFO L225 Difference]: With dead ends: 56 [2025-02-08 13:26:28,772 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 13:26:28,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 13:26:28,774 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:28,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 65 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 13:26:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 13:26:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 49 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-02-08 13:26:28,786 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 11 [2025-02-08 13:26:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:28,787 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-02-08 13:26:28,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 13:26:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-02-08 13:26:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:26:28,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:28,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:28,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:26:28,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:28,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1932166680, now seen corresponding path program 1 times [2025-02-08 13:26:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534969856] [2025-02-08 13:26:28,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:29,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:29,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:29,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:29,219 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 13:26:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534969856] [2025-02-08 13:26:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534969856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123353969] [2025-02-08 13:26:29,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:29,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:29,222 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 13:26:29,225 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 13:26:29,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:29,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:29,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:29,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:29,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:29,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:29,547 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 13:26:29,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:29,580 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 13:26:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123353969] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:29,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:29,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:26:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872329539] [2025-02-08 13:26:29,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:29,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:29,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:29,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:29,583 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:29,625 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2025-02-08 13:26:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:26:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:29,627 INFO L225 Difference]: With dead ends: 112 [2025-02-08 13:26:29,627 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 13:26:29,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:29,628 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:29,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 13:26:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 13:26:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.346938775510204) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-02-08 13:26:29,639 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 12 [2025-02-08 13:26:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:29,641 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-02-08 13:26:29,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-02-08 13:26:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:26:29,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:29,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:29,653 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 13:26:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:29,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 217724399, now seen corresponding path program 2 times [2025-02-08 13:26:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870745949] [2025-02-08 13:26:29,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:29,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:26:29,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:26:29,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:29,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870745949] [2025-02-08 13:26:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870745949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:26:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509219168] [2025-02-08 13:26:30,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:26:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:30,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:26:30,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:30,209 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 13:26:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:30,281 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-02-08 13:26:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:26:30,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 21 [2025-02-08 13:26:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:30,285 INFO L225 Difference]: With dead ends: 63 [2025-02-08 13:26:30,285 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 13:26:30,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:30,286 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:30,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 154 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 13:26:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 13:26:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2025-02-08 13:26:30,294 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 21 [2025-02-08 13:26:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:30,295 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2025-02-08 13:26:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 13:26:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2025-02-08 13:26:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:26:30,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:30,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:30,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:26:30,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:30,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 296630329, now seen corresponding path program 1 times [2025-02-08 13:26:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:30,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266630176] [2025-02-08 13:26:30,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:30,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:30,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:26:30,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:26:30,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:30,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266630176] [2025-02-08 13:26:30,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266630176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:30,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:30,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:26:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089914122] [2025-02-08 13:26:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:30,587 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 13:26:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:30,631 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2025-02-08 13:26:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:30,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 26 [2025-02-08 13:26:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:30,635 INFO L225 Difference]: With dead ends: 106 [2025-02-08 13:26:30,635 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 13:26:30,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:26:30,636 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:30,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 13:26:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 13:26:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-02-08 13:26:30,645 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 26 [2025-02-08 13:26:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:30,646 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-02-08 13:26:30,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 13:26:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-02-08 13:26:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:30,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:30,648 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:26:30,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2123635544, now seen corresponding path program 1 times [2025-02-08 13:26:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:30,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419940234] [2025-02-08 13:26:30,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:30,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:30,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:30,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:30,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:30,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:30,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:30,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419940234] [2025-02-08 13:26:30,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419940234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:30,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157820539] [2025-02-08 13:26:30,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:30,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:30,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:30,936 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 13:26:30,938 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 13:26:31,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:31,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:31,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:31,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:31,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:31,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:26:31,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157820539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705590010] [2025-02-08 13:26:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:31,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:31,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:31,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:31,300 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 13:26:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:31,342 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-02-08 13:26:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 29 [2025-02-08 13:26:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:31,344 INFO L225 Difference]: With dead ends: 64 [2025-02-08 13:26:31,344 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 13:26:31,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 13:26:31,345 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:31,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 13:26:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 13:26:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-02-08 13:26:31,351 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 29 [2025-02-08 13:26:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:31,351 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-02-08 13:26:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 13:26:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-02-08 13:26:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:31,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:31,352 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:31,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:26:31,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:26:31,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:31,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2123635384, now seen corresponding path program 1 times [2025-02-08 13:26:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:31,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107755652] [2025-02-08 13:26:31,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:31,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:31,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:31,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107755652] [2025-02-08 13:26:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107755652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758627439] [2025-02-08 13:26:31,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:31,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:31,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:26:31,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:32,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:32,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:32,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:32,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:26:32,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:26:32,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:26:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758627439] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:32,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:32,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:26:32,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290605206] [2025-02-08 13:26:32,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:32,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:26:32,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:32,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:26:32,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:26:32,297 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:26:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:32,431 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2025-02-08 13:26:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:26:32,434 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:26:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:32,435 INFO L225 Difference]: With dead ends: 129 [2025-02-08 13:26:32,435 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 13:26:32,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:26:32,438 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:32,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 284 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 13:26:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-08 13:26:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-02-08 13:26:32,450 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 29 [2025-02-08 13:26:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:32,451 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-02-08 13:26:32,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:26:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-02-08 13:26:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:26:32,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:32,452 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:32,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:26:32,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:32,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:32,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 594729686, now seen corresponding path program 1 times [2025-02-08 13:26:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995983612] [2025-02-08 13:26:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:32,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:26:32,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:26:32,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:32,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:32,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:32,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995983612] [2025-02-08 13:26:32,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995983612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:32,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:32,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372047776] [2025-02-08 13:26:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:32,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:32,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:32,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:32,885 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 13:26:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:32,932 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-02-08 13:26:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 48 [2025-02-08 13:26:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:32,933 INFO L225 Difference]: With dead ends: 91 [2025-02-08 13:26:32,933 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 13:26:32,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:26:32,934 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:32,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 13:26:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-02-08 13:26:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2025-02-08 13:26:32,943 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 48 [2025-02-08 13:26:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:32,943 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2025-02-08 13:26:32,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 13:26:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2025-02-08 13:26:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:26:32,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:32,945 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:32,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:26:32,945 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:32,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash 594734651, now seen corresponding path program 1 times [2025-02-08 13:26:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020846065] [2025-02-08 13:26:32,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:33,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:26:33,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:26:33,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:33,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020846065] [2025-02-08 13:26:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020846065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073514644] [2025-02-08 13:26:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:33,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:33,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:33,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:33,153 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 13:26:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:33,186 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2025-02-08 13:26:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 48 [2025-02-08 13:26:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:33,188 INFO L225 Difference]: With dead ends: 89 [2025-02-08 13:26:33,189 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 13:26:33,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:26:33,190 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:33,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 13:26:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-02-08 13:26:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2025-02-08 13:26:33,198 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 48 [2025-02-08 13:26:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:33,198 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2025-02-08 13:26:33,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 13:26:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2025-02-08 13:26:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:26:33,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:33,199 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:33,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:26:33,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:33,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash 959094195, now seen corresponding path program 1 times [2025-02-08 13:26:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299049007] [2025-02-08 13:26:33,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:33,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:26:33,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:26:33,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:33,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:26:33,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299049007] [2025-02-08 13:26:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299049007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628403110] [2025-02-08 13:26:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:33,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:33,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:33,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:33,397 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:33,417 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2025-02-08 13:26:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-02-08 13:26:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:33,418 INFO L225 Difference]: With dead ends: 89 [2025-02-08 13:26:33,418 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 13:26:33,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:26:33,419 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:33,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 13:26:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 13:26:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 82 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2025-02-08 13:26:33,426 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 54 [2025-02-08 13:26:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:33,426 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2025-02-08 13:26:33,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2025-02-08 13:26:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:26:33,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:33,428 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:33,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:26:33,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:33,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -332313203, now seen corresponding path program 1 times [2025-02-08 13:26:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:33,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016566312] [2025-02-08 13:26:33,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:33,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:33,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:33,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:33,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:26:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016566312] [2025-02-08 13:26:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016566312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296968828] [2025-02-08 13:26:33,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:33,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:33,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:33,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:33,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:26:33,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:34,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:34,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:34,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:34,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:34,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:26:34,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:26:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296968828] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:34,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:26:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185345775] [2025-02-08 13:26:34,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:34,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:34,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:34,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:34,126 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 13:26:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:34,195 INFO L93 Difference]: Finished difference Result 150 states and 174 transitions. [2025-02-08 13:26:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:34,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 55 [2025-02-08 13:26:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:34,199 INFO L225 Difference]: With dead ends: 150 [2025-02-08 13:26:34,199 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 13:26:34,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:34,199 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:34,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 203 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 13:26:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 13:26:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2025-02-08 13:26:34,212 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 55 [2025-02-08 13:26:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:34,213 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2025-02-08 13:26:34,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 13:26:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2025-02-08 13:26:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 13:26:34,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:34,214 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:34,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:26:34,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:26:34,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:34,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 972590931, now seen corresponding path program 1 times [2025-02-08 13:26:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:34,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840133477] [2025-02-08 13:26:34,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:34,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:26:34,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:26:34,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:34,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840133477] [2025-02-08 13:26:34,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840133477] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620073316] [2025-02-08 13:26:34,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:34,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:34,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:34,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:26:35,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:26:35,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:26:35,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:35,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:35,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 13:26:35,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:35,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:35,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620073316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:35,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-08 13:26:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862115895] [2025-02-08 13:26:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:35,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:26:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:35,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:26:35,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:26:35,446 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:35,506 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2025-02-08 13:26:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:35,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2025-02-08 13:26:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:35,508 INFO L225 Difference]: With dead ends: 122 [2025-02-08 13:26:35,508 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 13:26:35,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:26:35,508 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:35,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 228 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 13:26:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 13:26:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 100 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2025-02-08 13:26:35,523 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 58 [2025-02-08 13:26:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:35,523 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2025-02-08 13:26:35,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2025-02-08 13:26:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 13:26:35,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:35,524 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:35,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:35,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:35,726 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2042119883, now seen corresponding path program 1 times [2025-02-08 13:26:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:35,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098389427] [2025-02-08 13:26:35,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:35,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:26:35,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:26:35,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:35,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:26:35,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:35,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098389427] [2025-02-08 13:26:35,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098389427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183828450] [2025-02-08 13:26:35,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:35,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:35,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:35,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:35,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:26:36,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:26:36,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:26:36,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:36,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:36,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:36,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:26:36,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:36,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183828450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:36,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:36,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:26:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453779403] [2025-02-08 13:26:36,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:36,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:36,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:36,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:36,380 INFO L87 Difference]: Start difference. First operand 105 states and 115 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:36,401 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-02-08 13:26:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:26:36,402 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-02-08 13:26:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:36,404 INFO L225 Difference]: With dead ends: 105 [2025-02-08 13:26:36,404 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 13:26:36,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:36,404 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:36,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 13:26:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 13:26:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 99 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2025-02-08 13:26:36,414 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 57 [2025-02-08 13:26:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:36,415 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2025-02-08 13:26:36,415 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2025-02-08 13:26:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 13:26:36,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:36,417 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:36,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 13:26:36,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 13:26:36,622 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:36,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:36,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1118793205, now seen corresponding path program 1 times [2025-02-08 13:26:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244569953] [2025-02-08 13:26:36,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:36,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:26:36,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:26:36,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:36,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:26:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:36,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244569953] [2025-02-08 13:26:36,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244569953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:36,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003433902] [2025-02-08 13:26:36,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:36,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:36,831 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:36,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:26:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:26:37,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:26:37,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:37,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:37,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:26:37,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:26:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003433902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:37,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:26:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472957794] [2025-02-08 13:26:37,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:37,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:37,324 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:37,357 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2025-02-08 13:26:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:37,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2025-02-08 13:26:37,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:37,359 INFO L225 Difference]: With dead ends: 114 [2025-02-08 13:26:37,359 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 13:26:37,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:37,360 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:37,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 13:26:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-08 13:26:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 108 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2025-02-08 13:26:37,367 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 58 [2025-02-08 13:26:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:37,367 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2025-02-08 13:26:37,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2025-02-08 13:26:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 13:26:37,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:37,369 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:37,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:37,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:37,570 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:37,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash 876091861, now seen corresponding path program 1 times [2025-02-08 13:26:37,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:37,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590694620] [2025-02-08 13:26:37,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:37,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:26:37,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:26:37,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:37,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:26:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590694620] [2025-02-08 13:26:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590694620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737264108] [2025-02-08 13:26:37,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:37,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:37,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:37,972 INFO L229 MonitoredProcess]: Starting monitored process 11 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 13:26:37,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:26:38,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:26:38,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:26:38,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:38,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:38,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 13:26:38,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:38,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:38,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737264108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:38,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:38,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-08 13:26:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114589251] [2025-02-08 13:26:38,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:38,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:26:38,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:38,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:26:38,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:26:38,474 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:38,580 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2025-02-08 13:26:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2025-02-08 13:26:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:38,583 INFO L225 Difference]: With dead ends: 156 [2025-02-08 13:26:38,583 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 13:26:38,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:26:38,584 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:38,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 173 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 13:26:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-08 13:26:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.1428571428571428) internal successors, (120), 108 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2025-02-08 13:26:38,593 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 61 [2025-02-08 13:26:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:38,593 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2025-02-08 13:26:38,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2025-02-08 13:26:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 13:26:38,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:38,596 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:38,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 13:26:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 13:26:38,800 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -453394659, now seen corresponding path program 2 times [2025-02-08 13:26:38,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:38,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148354147] [2025-02-08 13:26:38,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:38,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:26:38,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:26:38,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:38,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:26:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148354147] [2025-02-08 13:26:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148354147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694022615] [2025-02-08 13:26:38,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:38,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:38,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:38,964 INFO L229 MonitoredProcess]: Starting monitored process 12 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 13:26:38,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 13:26:39,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:26:39,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:26:39,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:39,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:39,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:39,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:26:39,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:26:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694022615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:39,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:39,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 13:26:39,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203025456] [2025-02-08 13:26:39,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:39,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:26:39,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:39,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:26:39,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:26:39,586 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 13:26:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:39,679 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2025-02-08 13:26:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 73 [2025-02-08 13:26:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:39,680 INFO L225 Difference]: With dead ends: 113 [2025-02-08 13:26:39,680 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 13:26:39,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:26:39,681 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:39,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 13:26:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2025-02-08 13:26:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 92 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2025-02-08 13:26:39,690 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 73 [2025-02-08 13:26:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:39,690 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2025-02-08 13:26:39,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 13:26:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2025-02-08 13:26:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 13:26:39,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:39,692 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:39,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:26:39,893 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:39,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1240480115, now seen corresponding path program 1 times [2025-02-08 13:26:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:39,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173107832] [2025-02-08 13:26:39,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:39,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 13:26:39,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 13:26:39,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:39,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 13:26:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173107832] [2025-02-08 13:26:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173107832] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934630833] [2025-02-08 13:26:40,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:40,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:40,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:40,203 INFO L229 MonitoredProcess]: Starting monitored process 13 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 13:26:40,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 13:26:40,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 13:26:40,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 13:26:40,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:40,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:40,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:26:40,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:40,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 13:26:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934630833] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:40,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:40,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:26:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768395202] [2025-02-08 13:26:40,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:26:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:40,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:26:40,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:26:40,848 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:26:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:40,931 INFO L93 Difference]: Finished difference Result 174 states and 200 transitions. [2025-02-08 13:26:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:26:40,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2025-02-08 13:26:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:40,933 INFO L225 Difference]: With dead ends: 174 [2025-02-08 13:26:40,933 INFO L226 Difference]: Without dead ends: 115 [2025-02-08 13:26:40,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:26:40,933 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:40,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 243 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-08 13:26:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-02-08 13:26:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 110 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2025-02-08 13:26:40,940 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 77 [2025-02-08 13:26:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:40,940 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2025-02-08 13:26:40,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:26:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2025-02-08 13:26:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 13:26:40,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:40,941 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:40,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:41,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:41,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:26:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash -860134995, now seen corresponding path program 2 times [2025-02-08 13:26:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81853444] [2025-02-08 13:26:41,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:41,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:41,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-08 13:26:41,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 13:26:41,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:26:41,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-08 13:26:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81853444] [2025-02-08 13:26:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81853444] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:47,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275772831] [2025-02-08 13:26:47,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:47,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:47,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:47,223 INFO L229 MonitoredProcess]: Starting monitored process 14 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 13:26:47,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 13:26:47,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-08 13:26:47,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 13:26:47,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:26:47,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:47,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-08 13:26:47,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:47,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 13:26:47,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 13:26:47,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 13:26:47,879 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 13:26:47,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 13:26:47,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:47,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 84 [2025-02-08 13:26:47,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:47,973 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-08 13:26:47,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2025-02-08 13:26:47,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:47,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 116 [2025-02-08 13:26:48,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:48,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2025-02-08 13:26:48,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:48,033 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2025-02-08 13:26:48,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 59 [2025-02-08 13:26:48,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:48,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-02-08 13:26:48,058 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 13:26:48,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-08 13:26:48,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:48,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 110 [2025-02-08 13:26:48,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:26:48,138 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,201 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,264 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,325 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,401 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,454 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,566 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,621 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,682 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:26:48,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:26:48,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 13:26:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:26:48,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:52,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:26:52,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 5913 treesize of output 5919 [2025-02-08 13:26:52,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:26:52,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 5900 treesize of output 2631