./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/echo-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/echo-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 a4a230cce40eed7216e78addbce6b3ef4830ce5a9adefc3e86e3bd0189d80ac1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:24:42,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:24:42,218 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:24:42,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:24:42,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:24:42,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:24:42,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:24:42,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:24:42,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:24:42,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:24:42,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:24:42,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:24:42,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:24:42,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:24:42,256 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:24:42,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:24:42,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:24:42,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:24:42,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:24:42,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:24:42,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:24:42,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:24:42,257 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:24:42,257 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:24:42,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:24:42,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:24:42,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:24:42,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:24:42,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:24:42,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:24:42,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:24:42,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:42,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:24:42,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:24:42,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:24:42,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:24:42,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:24:42,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:24:42,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:24:42,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:24:42,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:24:42,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:24:42,260 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 -> a4a230cce40eed7216e78addbce6b3ef4830ce5a9adefc3e86e3bd0189d80ac1 [2025-02-08 13:24:42,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:24:42,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:24:42,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:24:42,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:24:42,554 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:24:42,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/echo-2.i [2025-02-08 13:24:43,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd369e3d2/c32b9272b28e498da400c43dc272b763/FLAG55903c06e [2025-02-08 13:24:44,331 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:24:44,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/echo-2.i [2025-02-08 13:24:44,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd369e3d2/c32b9272b28e498da400c43dc272b763/FLAG55903c06e [2025-02-08 13:24:44,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd369e3d2/c32b9272b28e498da400c43dc272b763 [2025-02-08 13:24:44,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:24:44,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:24:44,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:44,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:24:44,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:24:44,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:44" (1/1) ... [2025-02-08 13:24:44,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ce769f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:44, skipping insertion in model container [2025-02-08 13:24:44,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:44" (1/1) ... [2025-02-08 13:24:44,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:24:45,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:45,384 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:24:45,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:45,702 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:24:45,713 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:24:45,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45 WrapperNode [2025-02-08 13:24:45,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:45,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:45,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:24:45,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:24:45,721 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:24:45" (1/1) ... [2025-02-08 13:24:45,769 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:24:45" (1/1) ... [2025-02-08 13:24:45,864 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1063 [2025-02-08 13:24:45,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:45,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:24:45,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:24:45,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:24:45,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,914 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:24:45,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:45,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:46,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:24:46,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:24:46,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:24:46,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:24:46,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (1/1) ... [2025-02-08 13:24:46,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:46,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:46,041 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:24:46,044 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:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:24:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:24:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:24:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:24:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:24:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:24:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:24:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:24:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:24:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:24:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:24:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-02-08 13:24:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-02-08 13:24:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:24:46,413 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:24:46,414 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2554: assume ~total~0#1 + ~cc~0#1 <= 9223372036854775807;~total~0#1 := ~total~0#1 + ~cc~0#1;~buf#1.base, ~buf#1.offset := ~buf#1.base, ~buf#1.offset + ~cc~0#1;~len#1 := ~len#1 - ~cc~0#1; [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2554: assume !(~total~0#1 + ~cc~0#1 <= 9223372036854775807); [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2554-1: assume ~total~0#1 + ~cc~0#1 >= -9223372036854775808; [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2554-1: assume !(~total~0#1 + ~cc~0#1 >= -9223372036854775808); [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: assume !(0 == ~total~0#1);#res#1 := ~total~0#1; [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: assume !!(0 == ~total~0#1);#res#1 := ~cc~0#1; [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: assume ~cc~0#1 < 0; [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: assume !(~cc~0#1 < 0); [2025-02-08 13:24:46,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2547: #t~ret135#1 := safe_write_#res#1;havoc safe_write_#t~ret136#1, safe_write_#t~mem137#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~2#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 <= #t~ret135#1 && #t~ret135#1 <= 9223372036854775807;~cc~0#1 := #t~ret135#1;havoc #t~ret135#1; [2025-02-08 13:24:46,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: assume safe_write_~n~2#1 < 0;call safe_write_#t~mem137#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~mem137#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:46,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: assume !(safe_write_~n~2#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:24:46,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: safe_write_#t~ret136#1 := write_#res#1;havoc write_#t~nondet176#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#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~ret136#1 && safe_write_#t~ret136#1 <= 9223372036854775807;safe_write_~n~2#1 := safe_write_#t~ret136#1;havoc safe_write_#t~ret136#1; [2025-02-08 13:24:46,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:24:46,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:24:46,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2398: #t~ret107#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet134#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret107#1 && #t~ret107#1 <= 2147483647;havoc #t~ret107#1;call #t~mem108#1.base, #t~mem108#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8); [2025-02-08 13:24:46,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-1: SUMMARY for call #t~ret109#1 := full_write(2, #t~mem108#1.base, #t~mem108#1.offset, ~used~0#1); srcloc: null [2025-02-08 13:24:46,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399: assume -9223372036854775808 <= #t~ret109#1 && #t~ret109#1 <= 9223372036854775807;havoc #t~mem108#1.base, #t~mem108#1.offset;havoc #t~ret109#1; [2025-02-08 13:24:52,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: __main_#t~ret123#1.base, __main_#t~ret123#1.offset := stpcpy_#res#1.base, stpcpy_#res#1.offset;havoc stpcpy_#t~post142#1.base, stpcpy_#t~post142#1.offset, stpcpy_#t~post143#1.base, stpcpy_#t~post143#1.offset, stpcpy_#t~mem144#1, stpcpy_~dest#1.base, stpcpy_~dest#1.offset, stpcpy_~src#1.base, stpcpy_~src#1.offset;havoc stpcpy_#in~dest#1.base, stpcpy_#in~dest#1.offset, stpcpy_#in~src#1.base, stpcpy_#in~src#1.offset;assume { :end_inline_stpcpy } true;__main_~out~0#1.base, __main_~out~0#1.offset := __main_#t~ret123#1.base, __main_#t~ret123#1.offset; [2025-02-08 13:24:52,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: __main_#t~ret128#1 := bb_process_escape_sequence_#res#1;havoc bb_process_escape_sequence_#t~mem78#1.base, bb_process_escape_sequence_#t~mem78#1.offset, bb_process_escape_sequence_#t~mem79#1, bb_process_escape_sequence_#t~mem80#1, bb_process_escape_sequence_#t~bitwise81#1, bb_process_escape_sequence_~r~0#1, bb_process_escape_sequence_~d~0#1, bb_process_escape_sequence_#t~mem82#1, bb_process_escape_sequence_#t~mem83#1, bb_process_escape_sequence_#t~mem84#1, bb_process_escape_sequence_#t~mem85#1, bb_process_escape_sequence_~p~2#1.base, bb_process_escape_sequence_~p~2#1.offset, bb_process_escape_sequence_~ptr#1.base, bb_process_escape_sequence_~ptr#1.offset, bb_process_escape_sequence_~q~0#1.base, bb_process_escape_sequence_~q~0#1.offset, bb_process_escape_sequence_~num_digits~0#1, bb_process_escape_sequence_~n~0#1, bb_process_escape_sequence_~base~0#1;havoc bb_process_escape_sequence_#in~ptr#1.base, bb_process_escape_sequence_#in~ptr#1.offset;assume { :end_inline_bb_process_escape_sequence } true;assume -128 <= __main_#t~ret128#1 && __main_#t~ret128#1 <= 127;__main_~return_value_bb_process_escape_sequence$4~0#1 := __main_#t~ret128#1;havoc __main_#t~ret128#1;__main_~c~0#1 := __main_~return_value_bb_process_escape_sequence$4~0#1;call __main_#t~mem129#1.base, __main_#t~mem129#1.offset := read~$Pointer$(__main_~#z~0#1.base, __main_~#z~0#1.offset, 8);__main_~arg~0#1.base, __main_~arg~0#1.offset := __main_#t~mem129#1.base, __main_#t~mem129#1.offset;call ULTIMATE.dealloc(__main_~#z~0#1.base, __main_~#z~0#1.offset);havoc __main_~#z~0#1.base, __main_~#z~0#1.offset;havoc __main_~#z~0#1.base, __main_~#z~0#1.offset, __main_~return_value_bb_process_escape_sequence$4~0#1;havoc __main_#t~mem129#1.base, __main_#t~mem129#1.offset; [2025-02-08 13:24:52,572 INFO L? ?]: Removed 267 outVars from TransFormulas that were not future-live. [2025-02-08 13:24:52,572 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:24:52,595 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:24:52,595 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:24:52,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:24:52 BoogieIcfgContainer [2025-02-08 13:24:52,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:24:52,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:24:52,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:24:52,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:24:52,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:24:44" (1/3) ... [2025-02-08 13:24:52,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5dcfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:24:52, skipping insertion in model container [2025-02-08 13:24:52,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:45" (2/3) ... [2025-02-08 13:24:52,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5dcfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:24:52, skipping insertion in model container [2025-02-08 13:24:52,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:24:52" (3/3) ... [2025-02-08 13:24:52,603 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-2.i [2025-02-08 13:24:52,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:24:52,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-2.i that has 5 procedures, 216 locations, 1 initial locations, 19 loop locations, and 44 error locations. [2025-02-08 13:24:52,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:24:52,684 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;@35e40d81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:24:52,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-08 13:24:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 152 states have (on average 1.730263157894737) internal successors, (263), 203 states have internal predecessors, (263), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 13:24:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:24:52,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:52,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:24:52,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:24:52,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 351490, now seen corresponding path program 1 times [2025-02-08 13:24:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021981727] [2025-02-08 13:24:52,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:52,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:53,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:24:53,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:24:53,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:53,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:53,840 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:24:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021981727] [2025-02-08 13:24:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021981727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:53,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:53,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:24:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876953079] [2025-02-08 13:24:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:53,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:53,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:53,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:53,866 INFO L87 Difference]: Start difference. First operand has 216 states, 152 states have (on average 1.730263157894737) internal successors, (263), 203 states have internal predecessors, (263), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.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:24:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:53,953 INFO L93 Difference]: Finished difference Result 343 states and 463 transitions. [2025-02-08 13:24:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:53,955 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:24:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:53,963 INFO L225 Difference]: With dead ends: 343 [2025-02-08 13:24:53,963 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 13:24:53,967 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:24:53,970 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:53,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 307 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 13:24:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 13:24:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 82 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:24:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2025-02-08 13:24:54,004 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 3 [2025-02-08 13:24:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:54,005 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2025-02-08 13:24:54,005 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:24:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2025-02-08 13:24:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:24:54,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:54,006 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:24:54,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:24:54,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:24:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1881591101, now seen corresponding path program 1 times [2025-02-08 13:24:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:54,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890054746] [2025-02-08 13:24:54,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:54,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:54,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:24:54,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:54,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:54,716 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:24:54,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890054746] [2025-02-08 13:24:54,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890054746] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:54,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822892495] [2025-02-08 13:24:54,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:54,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:54,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:54,720 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:24:54,722 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:24:55,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:55,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:24:55,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:55,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:55,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:55,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:55,492 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:24:55,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:55,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822892495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:55,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:24:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172554396] [2025-02-08 13:24:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:55,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:24:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:55,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:24:55,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:55,498 INFO L87 Difference]: Start difference. First operand 88 states and 106 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:24:59,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:24:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:59,590 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2025-02-08 13:24:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:24:59,593 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:24:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:59,594 INFO L225 Difference]: With dead ends: 88 [2025-02-08 13:24:59,594 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 13:24:59,594 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:24:59,594 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:59,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 193 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:24:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 13:24:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 13:24:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.434782608695652) internal successors, (99), 81 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:24:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2025-02-08 13:24:59,605 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 6 [2025-02-08 13:24:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:59,606 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2025-02-08 13:24:59,606 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:24:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2025-02-08 13:24:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:24:59,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:59,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:24:59,616 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:24:59,810 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:24:59,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:24:59,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1800217724, now seen corresponding path program 1 times [2025-02-08 13:24:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042836474] [2025-02-08 13:24:59,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:00,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:25:00,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:25:00,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:00,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:00,377 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:25:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:00,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042836474] [2025-02-08 13:25:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042836474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019726550] [2025-02-08 13:25:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:00,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:00,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:00,380 INFO L87 Difference]: Start difference. First operand 87 states and 105 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:25:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:00,428 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2025-02-08 13:25:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:00,429 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:25:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:00,430 INFO L225 Difference]: With dead ends: 87 [2025-02-08 13:25:00,430 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 13:25:00,430 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:25:00,430 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 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:25:00,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 13:25:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-02-08 13:25:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 78 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2025-02-08 13:25:00,443 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 7 [2025-02-08 13:25:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:00,444 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2025-02-08 13:25:00,444 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:25:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2025-02-08 13:25:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:25:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:00,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:00,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:25:00,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:00,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash 151454450, now seen corresponding path program 1 times [2025-02-08 13:25:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:00,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192022079] [2025-02-08 13:25:00,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:00,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:25:00,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:25:00,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:00,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:01,118 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:25:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192022079] [2025-02-08 13:25:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192022079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402922561] [2025-02-08 13:25:01,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:01,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:01,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:01,122 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:25:01,125 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:25:01,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:25:01,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:25:01,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:01,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:01,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:25:01,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:01,903 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:25:01,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402922561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:01,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:01,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:25:01,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769836958] [2025-02-08 13:25:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:01,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:01,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:01,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:01,907 INFO L87 Difference]: Start difference. First operand 84 states and 102 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:25:05,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:05,995 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2025-02-08 13:25:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:05,996 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:25:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:05,997 INFO L225 Difference]: With dead ends: 84 [2025-02-08 13:25:05,997 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 13:25:05,997 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:25:05,997 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 73 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:05,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:25:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 13:25:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 13:25:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 76 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2025-02-08 13:25:06,003 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 11 [2025-02-08 13:25:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2025-02-08 13:25:06,004 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:25:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2025-02-08 13:25:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:25:06,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:06,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:06,016 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:25:06,209 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:25:06,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:06,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash 400120937, now seen corresponding path program 1 times [2025-02-08 13:25:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275444427] [2025-02-08 13:25:06,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:06,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:06,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:06,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:06,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:06,700 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:25:06,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275444427] [2025-02-08 13:25:06,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275444427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129548690] [2025-02-08 13:25:06,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:06,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:06,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:06,704 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:25:06,706 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:25:07,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:07,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:07,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:07,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:07,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:07,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:07,355 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:25:07,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:07,386 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:25:07,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129548690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:07,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:25:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017071183] [2025-02-08 13:25:07,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:07,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:07,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:07,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:07,387 INFO L87 Difference]: Start difference. First operand 82 states and 100 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:25:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:07,418 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2025-02-08 13:25:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:07,418 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:25:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:07,419 INFO L225 Difference]: With dead ends: 168 [2025-02-08 13:25:07,419 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 13:25:07,420 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:25:07,422 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:07,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 13:25:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 13:25:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.355263157894737) internal successors, (103), 85 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-02-08 13:25:07,429 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 12 [2025-02-08 13:25:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:07,429 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-02-08 13:25:07,430 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:25:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2025-02-08 13:25:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:25:07,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:07,430 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:07,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:25:07,630 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:25:07,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:07,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash 878551214, now seen corresponding path program 2 times [2025-02-08 13:25:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295006716] [2025-02-08 13:25:07,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:07,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:25:07,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:25:07,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:25:07,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:08,297 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:25:08,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295006716] [2025-02-08 13:25:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295006716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:08,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:25:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255457468] [2025-02-08 13:25:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:08,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:25:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:08,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:25:08,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:08,299 INFO L87 Difference]: Start difference. First operand 91 states and 109 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:25:12,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:12,383 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2025-02-08 13:25:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:25:12,384 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:25:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:12,385 INFO L225 Difference]: With dead ends: 91 [2025-02-08 13:25:12,385 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 13:25:12,385 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:25:12,386 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 72 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:12,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 278 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:25:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 13:25:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-08 13:25:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 83 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2025-02-08 13:25:12,398 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 21 [2025-02-08 13:25:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:12,399 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2025-02-08 13:25:12,399 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:25:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2025-02-08 13:25:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:25:12,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:12,399 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:25:12,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:25:12,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:12,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1041003112, now seen corresponding path program 1 times [2025-02-08 13:25:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993014965] [2025-02-08 13:25:12,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:12,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:25:12,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:25:12,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:12,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:12,975 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:25:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993014965] [2025-02-08 13:25:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993014965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832683337] [2025-02-08 13:25:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:12,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:12,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:12,977 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 3 states, 2 states have (on average 7.5) 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:25:17,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:17,042 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2025-02-08 13:25:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:17,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) 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:25:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:17,044 INFO L225 Difference]: With dead ends: 158 [2025-02-08 13:25:17,044 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 13:25:17,044 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:25:17,044 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:17,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:25:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 13:25:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 13:25:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 86 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2025-02-08 13:25:17,053 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 26 [2025-02-08 13:25:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2025-02-08 13:25:17,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) 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:25:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2025-02-08 13:25:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:25:17,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:17,054 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:25:17,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:25:17,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:17,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1434863609, now seen corresponding path program 1 times [2025-02-08 13:25:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:17,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266620497] [2025-02-08 13:25:17,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:17,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:17,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:17,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:17,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:17,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:17,527 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:25:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266620497] [2025-02-08 13:25:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266620497] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097404048] [2025-02-08 13:25:17,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:17,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:17,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:17,530 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:25:17,531 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:25:18,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:18,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:18,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:18,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:18,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:25:18,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:18,318 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:25:18,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:18,418 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:25:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097404048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:18,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:25:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807072264] [2025-02-08 13:25:18,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:18,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:25:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:18,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:25:18,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:25:18,420 INFO L87 Difference]: Start difference. First operand 92 states and 110 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:25:22,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:26,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:26,661 INFO L93 Difference]: Finished difference Result 187 states and 229 transitions. [2025-02-08 13:25:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:25:26,662 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:25:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:26,663 INFO L225 Difference]: With dead ends: 187 [2025-02-08 13:25:26,663 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 13:25:26,664 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:25:26,665 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:26,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 690 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-08 13:25:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 13:25:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-08 13:25:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 103 states have internal predecessors, (121), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2025-02-08 13:25:26,676 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 29 [2025-02-08 13:25:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:26,676 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2025-02-08 13:25:26,676 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:25:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2025-02-08 13:25:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:25:26,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:26,678 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] [2025-02-08 13:25:26,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:26,878 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:25:26,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 480816583, now seen corresponding path program 1 times [2025-02-08 13:25:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9837532] [2025-02-08 13:25:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:27,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:25:27,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:25:27,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:27,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:27,294 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:25:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9837532] [2025-02-08 13:25:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9837532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943735007] [2025-02-08 13:25:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:27,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:27,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:27,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:27,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:27,296 INFO L87 Difference]: Start difference. First operand 109 states and 127 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:25:31,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:31,364 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2025-02-08 13:25:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:31,364 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 47 [2025-02-08 13:25:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:31,365 INFO L225 Difference]: With dead ends: 121 [2025-02-08 13:25:31,365 INFO L226 Difference]: Without dead ends: 119 [2025-02-08 13:25:31,365 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:25:31,366 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:31,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 178 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:25:31,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-08 13:25:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-02-08 13:25:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 112 states have internal predecessors, (133), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2025-02-08 13:25:31,371 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 47 [2025-02-08 13:25:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:31,372 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2025-02-08 13:25:31,372 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:25:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2025-02-08 13:25:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:25:31,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:31,373 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:25:31,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:25:31,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:31,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2020417418, now seen corresponding path program 1 times [2025-02-08 13:25:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310262600] [2025-02-08 13:25:31,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:31,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:25:31,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:25:31,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:31,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:31,798 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:25:31,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310262600] [2025-02-08 13:25:31,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310262600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:31,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925800447] [2025-02-08 13:25:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:31,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:31,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:31,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:31,802 INFO L87 Difference]: Start difference. First operand 118 states and 139 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:25:35,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:35,867 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2025-02-08 13:25:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:35,868 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:25:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:35,868 INFO L225 Difference]: With dead ends: 118 [2025-02-08 13:25:35,868 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 13:25:35,869 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:25:35,869 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:35,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:25:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 13:25:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2025-02-08 13:25:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 107 states have internal predecessors, (127), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2025-02-08 13:25:35,875 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 48 [2025-02-08 13:25:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:35,875 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2025-02-08 13:25:35,876 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:25:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2025-02-08 13:25:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:25:35,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:35,877 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] [2025-02-08 13:25:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:25:35,877 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:35,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 215903360, now seen corresponding path program 1 times [2025-02-08 13:25:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:35,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721083930] [2025-02-08 13:25:35,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:36,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:25:36,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:25:36,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:36,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:25:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721083930] [2025-02-08 13:25:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721083930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153230126] [2025-02-08 13:25:36,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:36,351 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:25:36,354 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:25:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:25:37,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:25:37,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:37,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:37,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1637 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:37,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:25:37,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:25:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153230126] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:37,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:25:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130933679] [2025-02-08 13:25:37,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:37,154 INFO L87 Difference]: Start difference. First operand 113 states and 133 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:25:41,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:45,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:49,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:53,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:57,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:57,304 INFO L93 Difference]: Finished difference Result 198 states and 241 transitions. [2025-02-08 13:25:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:57,305 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 54 [2025-02-08 13:25:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:57,306 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:25:57,306 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 13:25:57,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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:25:57,307 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:57,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 270 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-02-08 13:25:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 13:25:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 13:25:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 125 states have internal predecessors, (145), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:25:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2025-02-08 13:25:57,313 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 54 [2025-02-08 13:25:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:57,313 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2025-02-08 13:25:57,313 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:25:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2025-02-08 13:25:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 13:25:57,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:57,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:57,331 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:25:57,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 13:25:57,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting bb_verror_msgErr25ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1317037798, now seen corresponding path program 1 times [2025-02-08 13:25:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169577431] [2025-02-08 13:25:57,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:57,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:25:57,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:25:57,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:57,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:57,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169577431] [2025-02-08 13:25:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169577431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:25:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022751808] [2025-02-08 13:25:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:57,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:57,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:57,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:57,895 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:57,911 INFO L93 Difference]: Finished difference Result 168 states and 195 transitions. [2025-02-08 13:25:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:57,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 13:25:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:57,912 INFO L225 Difference]: With dead ends: 168 [2025-02-08 13:25:57,913 INFO L226 Difference]: Without dead ends: 129 [2025-02-08 13:25:57,913 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:25:57,913 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:57,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-08 13:25:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-02-08 13:25:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 123 states have internal predecessors, (142), 3 states have call successors, (3), 3 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:25:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2025-02-08 13:25:57,919 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 57 [2025-02-08 13:25:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:57,920 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2025-02-08 13:25:57,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2025-02-08 13:25:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 13:25:57,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:57,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:57,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:25:57,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:25:57,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1419405010, now seen corresponding path program 1 times [2025-02-08 13:25:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927990482] [2025-02-08 13:25:57,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:58,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 13:25:58,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 13:25:58,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:58,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:58,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:58,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927990482] [2025-02-08 13:25:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927990482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995054579] [2025-02-08 13:25:58,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:58,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:58,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:58,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:58,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:58,378 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:02,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:02,437 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2025-02-08 13:26:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 64 [2025-02-08 13:26:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:02,439 INFO L225 Difference]: With dead ends: 134 [2025-02-08 13:26:02,439 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 13:26:02,439 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:02,439 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:02,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 13:26:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-08 13:26:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 122 states have (on average 1.1885245901639345) internal successors, (145), 126 states have internal predecessors, (145), 3 states have call successors, (3), 3 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:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2025-02-08 13:26:02,449 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 64 [2025-02-08 13:26:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:02,450 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2025-02-08 13:26:02,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2025-02-08 13:26:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 13:26:02,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:02,452 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:02,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:26:02,452 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:26:02,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1541740097, now seen corresponding path program 1 times [2025-02-08 13:26:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757240988] [2025-02-08 13:26:02,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:02,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 13:26:02,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 13:26:02,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:02,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757240988] [2025-02-08 13:26:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757240988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218581135] [2025-02-08 13:26:02,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:02,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:02,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:02,902 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:02,904 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:03,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 13:26:03,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 13:26:03,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:03,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:03,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1677 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:26:03,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:03,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218581135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:03,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-02-08 13:26:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551888698] [2025-02-08 13:26:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:03,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:26:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:03,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:26:03,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:03,869 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:07,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:11,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:15,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:16,012 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2025-02-08 13:26:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:26:16,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-02-08 13:26:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:16,013 INFO L225 Difference]: With dead ends: 178 [2025-02-08 13:26:16,013 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 13:26:16,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:16,014 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:16,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 295 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2025-02-08 13:26:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 13:26:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2025-02-08 13:26:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 159 states have internal predecessors, (188), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:26:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2025-02-08 13:26:16,022 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 67 [2025-02-08 13:26:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2025-02-08 13:26:16,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2025-02-08 13:26:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 13:26:16,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:16,026 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, 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:16,036 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:16,226 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,SelfDestructingSolverStorable13 [2025-02-08 13:26:16,226 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr25ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-08 13:26:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1689680036, now seen corresponding path program 1 times [2025-02-08 13:26:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863563848] [2025-02-08 13:26:16,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:16,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 13:26:16,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 13:26:16,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:16,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:16,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:16,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863563848] [2025-02-08 13:26:16,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863563848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:16,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:16,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:26:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008821500] [2025-02-08 13:26:16,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:16,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:16,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:16,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:26:16,663 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)