./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/sleep-3.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/sleep-3.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 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:28:01,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:28:01,199 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:28:01,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:28:01,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:28:01,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:28:01,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:28:01,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:28:01,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:28:01,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:28:01,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:28:01,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:28:01,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:28:01,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:28:01,219 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:28:01,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:28:01,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:28:01,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:28:01,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:28:01,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:28:01,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:28:01,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:28:01,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:28:01,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:28:01,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:28:01,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:28:01,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:28:01,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:28:01,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:28:01,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:28:01,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:28:01,222 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 -> 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e [2025-02-08 13:28:01,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:28:01,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:28:01,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:28:01,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:28:01,456 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:28:01,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-02-08 13:28:02,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52a2383fb/15097f3aab9348058dac0eff40fa60f5/FLAG4da50d3d0 [2025-02-08 13:28:02,862 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:28:02,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-02-08 13:28:02,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52a2383fb/15097f3aab9348058dac0eff40fa60f5/FLAG4da50d3d0 [2025-02-08 13:28:03,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52a2383fb/15097f3aab9348058dac0eff40fa60f5 [2025-02-08 13:28:03,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:28:03,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:28:03,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:28:03,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:28:03,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:28:03,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:28:03" (1/1) ... [2025-02-08 13:28:03,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90bd751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:03, skipping insertion in model container [2025-02-08 13:28:03,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:28:03" (1/1) ... [2025-02-08 13:28:03,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:28:03,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:28:03,817 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:28:03,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:28:04,037 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:28:04,043 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:28:04,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04 WrapperNode [2025-02-08 13:28:04,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:28:04,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:28:04,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:28:04,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:28:04,050 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:28:04" (1/1) ... [2025-02-08 13:28:04,090 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:28:04" (1/1) ... [2025-02-08 13:28:04,146 INFO L138 Inliner]: procedures = 633, calls = 577, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1049 [2025-02-08 13:28:04,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:28:04,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:28:04,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:28:04,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:28:04,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,184 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:28:04,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:28:04,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:28:04,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:28:04,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:28:04,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (1/1) ... [2025-02-08 13:28:04,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:28:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:04,282 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:28:04,289 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:28:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:28:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:28:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-02-08 13:28:04,312 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-02-08 13:28:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:28:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:28:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:28:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:28:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:28:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:28:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:28:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:28:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-08 13:28:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-08 13:28:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:28:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:28:04,315 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:28:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:28:04,716 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:28:04,718 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:28:04,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet187#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet187#1;assume -9223372036854775808 <= write_#t~nondet187#1 && write_#t~nondet187#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet187#1;havoc write_#t~nondet187#1; [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: assume !true; [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: full_write_#t~ret103#1 := safe_write_#res#1;havoc safe_write_#t~ret104#1, safe_write_#t~mem105#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret103#1 && full_write_#t~ret103#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret103#1;havoc full_write_#t~ret103#1; [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2505-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2481: assume full_write_~cc~0#1 < 0; [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2481: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2498: safe_write_#t~ret104#1 := write_#res#1;havoc write_#t~nondet187#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~ret104#1 && safe_write_#t~ret104#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret104#1;havoc safe_write_#t~ret104#1; [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2499: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem105#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~mem105#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:28:04,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2499: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: write_#res#1 := write_~ret~1#1; [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461: bb_verror_msg_#t~ret96#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet102#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret96#1 && bb_verror_msg_#t~ret96#1 <= 2147483647;havoc bb_verror_msg_#t~ret96#1;call bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret103#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret104#1, safe_write_#t~mem105#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:28:04,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: bb_verror_msg_#t~ret98#1 := full_write_#res#1;havoc full_write_#t~ret103#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret98#1 && bb_verror_msg_#t~ret98#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset;havoc bb_verror_msg_#t~ret98#1; [2025-02-08 13:28:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2487-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:28:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2487-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:28:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2487: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:28:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2487: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:28:09,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: call ULTIMATE.dealloc(__main_~#ts~0#1.base, __main_~#ts~0#1.offset);havoc __main_~#ts~0#1.base, __main_~#ts~0#1.offset; [2025-02-08 13:28:09,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume !(4 == __main_#t~mem124#1);havoc __main_#t~mem124#1; [2025-02-08 13:28:09,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume !!(4 == __main_#t~mem124#1);havoc __main_#t~mem124#1; [2025-02-08 13:28:09,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2689: havoc nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1;__main_#t~ret123#1 := nanosleep_#res#1;havoc nanosleep_#t~nondet144#1, nanosleep_#t~nondet145#1, nanosleep_#t~nondet146#1, nanosleep_#t~mem147#1, nanosleep_#t~short148#1, nanosleep_#t~mem149#1, nanosleep_#t~short150#1, nanosleep_#t~mem151#1, nanosleep_#t~mem152#1, nanosleep_#t~nondet153#1, nanosleep_#t~mem154#1, nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1, nanosleep_~__requested_time#1.base, nanosleep_~__requested_time#1.offset, nanosleep_~__remaining#1.base, nanosleep_~__remaining#1.offset;havoc nanosleep_#in~__requested_time#1.base, nanosleep_#in~__requested_time#1.offset, nanosleep_#in~__remaining#1.base, nanosleep_#in~__remaining#1.offset;assume { :end_inline_nanosleep } true;assume -2147483648 <= __main_#t~ret123#1 && __main_#t~ret123#1 <= 2147483647;havoc __main_#t~ret123#1;call __main_#t~mem124#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:28:10,048 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2025-02-08 13:28:10,049 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:28:10,058 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:28:10,059 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:28:10,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:28:10 BoogieIcfgContainer [2025-02-08 13:28:10,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:28:10,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:28:10,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:28:10,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:28:10,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:28:03" (1/3) ... [2025-02-08 13:28:10,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb8419c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:28:10, skipping insertion in model container [2025-02-08 13:28:10,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:04" (2/3) ... [2025-02-08 13:28:10,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb8419c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:28:10, skipping insertion in model container [2025-02-08 13:28:10,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:28:10" (3/3) ... [2025-02-08 13:28:10,064 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-3.i [2025-02-08 13:28:10,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:28:10,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-3.i that has 6 procedures, 189 locations, 1 initial locations, 14 loop locations, and 38 error locations. [2025-02-08 13:28:10,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:28:10,115 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;@3b848a42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:28:10,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-08 13:28:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 127 states have (on average 1.669291338582677) internal successors, (212), 172 states have internal predecessors, (212), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:28:10,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:10,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:28:10,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:10,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash 257155, now seen corresponding path program 1 times [2025-02-08 13:28:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:10,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302836768] [2025-02-08 13:28:10,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:10,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:28:10,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:28:10,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:10,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:10,867 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:28:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302836768] [2025-02-08 13:28:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302836768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:10,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:28:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185241977] [2025-02-08 13:28:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:10,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:10,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:10,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:10,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:10,888 INFO L87 Difference]: Start difference. First operand has 189 states, 127 states have (on average 1.669291338582677) internal successors, (212), 172 states have internal predecessors, (212), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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:28:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:10,927 INFO L93 Difference]: Finished difference Result 268 states and 346 transitions. [2025-02-08 13:28:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:10,929 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:28:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:10,933 INFO L225 Difference]: With dead ends: 268 [2025-02-08 13:28:10,934 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 13:28:10,937 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:28:10,939 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:10,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 13:28:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 13:28:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.5) internal successors, (84), 70 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2025-02-08 13:28:10,971 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 3 [2025-02-08 13:28:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:10,972 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2025-02-08 13:28:10,972 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:28:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2025-02-08 13:28:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:28:10,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:10,974 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:28:10,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:28:10,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash -928837219, now seen corresponding path program 1 times [2025-02-08 13:28:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:10,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246714938] [2025-02-08 13:28:10,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:11,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:28:11,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:28:11,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:11,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:11,392 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:28:11,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246714938] [2025-02-08 13:28:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246714938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551472778] [2025-02-08 13:28:11,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:11,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:11,394 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:28:11,396 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:28:11,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:28:11,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:28:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:11,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:11,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:11,878 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:28:11,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:11,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551472778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:11,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:11,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:28:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415810547] [2025-02-08 13:28:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:11,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:28:11,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:11,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:28:11,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:11,884 INFO L87 Difference]: Start difference. First operand 75 states and 90 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:28:15,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:15,990 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2025-02-08 13:28:15,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:28:15,990 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:28:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:15,992 INFO L225 Difference]: With dead ends: 75 [2025-02-08 13:28:15,992 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 13:28:15,993 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:28:15,993 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:15,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 241 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 13:28:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 13:28:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 69 states have internal predecessors, (83), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-02-08 13:28:15,998 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 6 [2025-02-08 13:28:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:15,999 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-02-08 13:28:15,999 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:28:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-02-08 13:28:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:28:15,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:15,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:28:16,008 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:28:16,199 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:28:16,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:16,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1270817477, now seen corresponding path program 1 times [2025-02-08 13:28:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:16,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356672698] [2025-02-08 13:28:16,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:16,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:28:16,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:28:16,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:16,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:16,501 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:28:16,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356672698] [2025-02-08 13:28:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356672698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:16,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:16,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072411113] [2025-02-08 13:28:16,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:16,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:16,503 INFO L87 Difference]: Start difference. First operand 74 states and 89 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:28:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:16,527 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-02-08 13:28:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:16,528 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:28:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:16,529 INFO L225 Difference]: With dead ends: 74 [2025-02-08 13:28:16,529 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 13:28:16,529 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:28:16,529 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 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:28:16,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 13:28:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-02-08 13:28:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 66 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2025-02-08 13:28:16,533 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 7 [2025-02-08 13:28:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:16,533 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2025-02-08 13:28:16,533 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:28:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2025-02-08 13:28:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:28:16,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:16,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:16,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:28:16,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:16,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1364702141, now seen corresponding path program 1 times [2025-02-08 13:28:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:16,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799417912] [2025-02-08 13:28:16,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:16,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:16,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:16,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:16,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:16,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:16,863 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:28:16,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799417912] [2025-02-08 13:28:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799417912] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453865831] [2025-02-08 13:28:16,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:16,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:16,866 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:28:16,867 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:28:17,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:17,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:17,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:17,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:17,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:28:17,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:17,316 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:28:17,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453865831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:28:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961287610] [2025-02-08 13:28:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:17,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:17,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:17,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:17,318 INFO L87 Difference]: Start difference. First operand 71 states and 86 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:28:21,333 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:28:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:21,365 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-02-08 13:28:21,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:21,366 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:28:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:21,366 INFO L225 Difference]: With dead ends: 71 [2025-02-08 13:28:21,366 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 13:28:21,366 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:28:21,369 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 28 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:21,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 13:28:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 13:28:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 13:28:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 64 states have internal predecessors, (78), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2025-02-08 13:28:21,380 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 11 [2025-02-08 13:28:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:21,380 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2025-02-08 13:28:21,380 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:28:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2025-02-08 13:28:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:28:21,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:21,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:21,392 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:28:21,581 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:28:21,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:21,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash 643906777, now seen corresponding path program 1 times [2025-02-08 13:28:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17032099] [2025-02-08 13:28:21,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:21,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:21,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:21,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:21,862 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:28:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17032099] [2025-02-08 13:28:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17032099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:21,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937165628] [2025-02-08 13:28:21,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:21,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:21,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:21,866 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:28:21,873 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:28:22,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:22,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:22,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:22,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:22,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:22,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:22,313 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:28:22,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:22,341 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:28:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937165628] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:22,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:28:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633071804] [2025-02-08 13:28:22,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:22,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:22,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:22,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:22,343 INFO L87 Difference]: Start difference. First operand 69 states and 84 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:28:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:22,370 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2025-02-08 13:28:22,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:22,371 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:28:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:22,371 INFO L225 Difference]: With dead ends: 142 [2025-02-08 13:28:22,371 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 13:28:22,372 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:28:22,372 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:22,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 13:28:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-08 13:28:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.380952380952381) internal successors, (87), 73 states have internal predecessors, (87), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2025-02-08 13:28:22,376 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 12 [2025-02-08 13:28:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:22,376 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2025-02-08 13:28:22,376 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:28:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2025-02-08 13:28:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:28:22,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:22,377 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:22,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:22,577 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:28:22,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:22,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash 204621503, now seen corresponding path program 2 times [2025-02-08 13:28:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969475359] [2025-02-08 13:28:22,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:22,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:28:22,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:28:22,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:28:22,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:22,925 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:28:22,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:22,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969475359] [2025-02-08 13:28:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969475359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:22,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:28:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288316366] [2025-02-08 13:28:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:22,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:28:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:22,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:28:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:22,927 INFO L87 Difference]: Start difference. First operand 78 states and 93 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:28:26,941 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:28:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:27,024 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2025-02-08 13:28:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:28:27,025 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:28:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:27,025 INFO L225 Difference]: With dead ends: 78 [2025-02-08 13:28:27,025 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 13:28:27,026 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:28:27,026 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:27,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 263 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 13:28:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-08 13:28:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 71 states have internal predecessors, (85), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2025-02-08 13:28:27,034 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 21 [2025-02-08 13:28:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:27,034 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2025-02-08 13:28:27,034 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:28:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2025-02-08 13:28:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:28:27,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:27,035 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:28:27,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:28:27,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:27,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2033543592, now seen corresponding path program 1 times [2025-02-08 13:28:27,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:27,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554379289] [2025-02-08 13:28:27,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:27,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:28:27,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:28:27,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:27,310 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:28:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554379289] [2025-02-08 13:28:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554379289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893796961] [2025-02-08 13:28:27,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:27,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:27,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:27,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:27,312 INFO L87 Difference]: Start difference. First operand 76 states and 91 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:28:31,327 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:28:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:31,364 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2025-02-08 13:28:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:31,365 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:28:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:31,366 INFO L225 Difference]: With dead ends: 132 [2025-02-08 13:28:31,366 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 13:28:31,366 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:28:31,366 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 151 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:31,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 151 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 13:28:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 13:28:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 13:28:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 74 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2025-02-08 13:28:31,378 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 26 [2025-02-08 13:28:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:31,378 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2025-02-08 13:28:31,378 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:28:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2025-02-08 13:28:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:28:31,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:31,379 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:28:31,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:28:31,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -783262312, now seen corresponding path program 1 times [2025-02-08 13:28:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768323753] [2025-02-08 13:28:31,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:31,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:31,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:31,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:31,756 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:28:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768323753] [2025-02-08 13:28:31,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768323753] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302145149] [2025-02-08 13:28:31,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:31,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:31,758 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:28:31,765 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:28:32,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:32,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:32,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:32,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:32,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:28:32,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:32,274 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:28:32,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:32,354 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:28:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302145149] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:32,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:32,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:28:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684395026] [2025-02-08 13:28:32,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:32,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:28:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:32,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:28:32,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:32,356 INFO L87 Difference]: Start difference. First operand 79 states and 94 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:28:36,370 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:28:40,377 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:28:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:40,494 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2025-02-08 13:28:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:28:40,494 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:28:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:40,495 INFO L225 Difference]: With dead ends: 161 [2025-02-08 13:28:40,495 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 13:28:40,496 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:28:40,496 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 5 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:40,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 352 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-08 13:28:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 13:28:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 13:28:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.25) internal successors, (105), 91 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2025-02-08 13:28:40,500 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 29 [2025-02-08 13:28:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:40,501 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2025-02-08 13:28:40,501 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:28:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2025-02-08 13:28:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:28:40,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:40,501 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:28:40,510 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:28:40,702 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:28:40,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:40,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1902087624, now seen corresponding path program 1 times [2025-02-08 13:28:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238195375] [2025-02-08 13:28:40,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:40,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:40,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:28:40,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:28:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:40,938 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:28:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238195375] [2025-02-08 13:28:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238195375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:40,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730234252] [2025-02-08 13:28:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:40,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:40,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:40,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:40,940 INFO L87 Difference]: Start difference. First operand 96 states and 111 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:28:44,955 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:28:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:44,985 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2025-02-08 13:28:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:44,985 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:28:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:44,986 INFO L225 Difference]: With dead ends: 108 [2025-02-08 13:28:44,986 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 13:28:44,986 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:28:44,986 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:44,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 13:28:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 13:28:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-08 13:28:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 100 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2025-02-08 13:28:44,991 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 47 [2025-02-08 13:28:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:44,991 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2025-02-08 13:28:44,991 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:28:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2025-02-08 13:28:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:28:44,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:44,992 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:28:44,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:28:44,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:44,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1164830938, now seen corresponding path program 1 times [2025-02-08 13:28:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043300144] [2025-02-08 13:28:44,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:44,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:45,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:28:45,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:28:45,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:45,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:45,258 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:28:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043300144] [2025-02-08 13:28:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043300144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355444549] [2025-02-08 13:28:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:45,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:45,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:45,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:45,259 INFO L87 Difference]: Start difference. First operand 105 states and 123 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:28:49,275 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:28:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:49,312 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2025-02-08 13:28:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:49,312 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:28:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:49,313 INFO L225 Difference]: With dead ends: 105 [2025-02-08 13:28:49,313 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 13:28:49,313 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:28:49,314 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:49,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 13:28:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 13:28:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-02-08 13:28:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.247191011235955) internal successors, (111), 95 states have internal predecessors, (111), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2025-02-08 13:28:49,324 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 48 [2025-02-08 13:28:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:49,325 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2025-02-08 13:28:49,325 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:28:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2025-02-08 13:28:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 13:28:49,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:49,325 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] [2025-02-08 13:28:49,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:28:49,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting xatoul_sfxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:49,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -180363370, now seen corresponding path program 1 times [2025-02-08 13:28:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486302673] [2025-02-08 13:28:49,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 13:28:49,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 13:28:49,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:49,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:49,679 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:28:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:49,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486302673] [2025-02-08 13:28:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486302673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:49,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:49,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:28:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823747592] [2025-02-08 13:28:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:49,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:28:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:49,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:28:49,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:49,681 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:53,701 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:28:57,708 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:28:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:57,802 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2025-02-08 13:28:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:28:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-02-08 13:28:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:57,803 INFO L225 Difference]: With dead ends: 109 [2025-02-08 13:28:57,803 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 13:28:57,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:28:57,804 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:57,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 255 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-08 13:28:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 13:28:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2025-02-08 13:28:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 99 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2025-02-08 13:28:57,812 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 52 [2025-02-08 13:28:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:57,812 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2025-02-08 13:28:57,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2025-02-08 13:28:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 13:28:57,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:57,815 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] [2025-02-08 13:28:57,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:28:57,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting xatoul_sfxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:28:57,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -180333579, now seen corresponding path program 1 times [2025-02-08 13:28:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:57,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501502825] [2025-02-08 13:28:57,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:57,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 13:28:58,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 13:28:58,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:58,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:58,317 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:28:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:58,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501502825] [2025-02-08 13:28:58,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501502825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:58,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:28:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159377371] [2025-02-08 13:28:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:58,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:28:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:58,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:28:58,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:28:58,321 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:29:02,335 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:29:06,342 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:29:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:06,409 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2025-02-08 13:29:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:29:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-02-08 13:29:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:06,412 INFO L225 Difference]: With dead ends: 151 [2025-02-08 13:29:06,412 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 13:29:06,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:29:06,412 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:06,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 312 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-08 13:29:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 13:29:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 13:29:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 99 states have internal predecessors, (115), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:29:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2025-02-08 13:29:06,417 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 52 [2025-02-08 13:29:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:06,417 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2025-02-08 13:29:06,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:29:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2025-02-08 13:29:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:29:06,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:06,418 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:29:06,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:29:06,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:29:06,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:06,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1093452240, now seen corresponding path program 1 times [2025-02-08 13:29:06,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:06,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283583081] [2025-02-08 13:29:06,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:06,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:06,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:29:06,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:29:06,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:06,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:06,694 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:29:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283583081] [2025-02-08 13:29:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283583081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851218073] [2025-02-08 13:29:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:06,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:06,699 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:29:06,702 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:29:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:29:07,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:29:07,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:07,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:07,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:07,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:07,242 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:29:07,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:29:07,264 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:29:07,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851218073] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:29:07,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:29:07,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:29:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759741827] [2025-02-08 13:29:07,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:29:07,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:29:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:07,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:29:07,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:29:07,267 INFO L87 Difference]: Start difference. First operand 104 states and 121 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:29:11,282 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:29:15,291 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:29:19,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:23,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:29:27,334 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:29:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:27,393 INFO L93 Difference]: Finished difference Result 180 states and 218 transitions. [2025-02-08 13:29:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:29:27,396 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:29:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:27,396 INFO L225 Difference]: With dead ends: 180 [2025-02-08 13:29:27,396 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 13:29:27,397 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:29:27,400 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 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:29:27,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-02-08 13:29:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 13:29:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-08 13:29:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 117 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:29:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2025-02-08 13:29:27,407 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 54 [2025-02-08 13:29:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:27,408 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2025-02-08 13:29:27,408 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:29:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2025-02-08 13:29:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 13:29:27,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:27,411 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 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:29:27,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:29:27,611 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,SelfDestructingSolverStorable12 [2025-02-08 13:29:27,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting xatoul_sfxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 35 more)] === [2025-02-08 13:29:27,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1054492989, now seen corresponding path program 1 times [2025-02-08 13:29:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:27,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093729094] [2025-02-08 13:29:27,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:27,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 13:29:27,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 13:29:27,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:27,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:29:27,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:27,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093729094] [2025-02-08 13:29:27,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093729094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:27,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5007779] [2025-02-08 13:29:27,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:27,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:27,973 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:29:27,975 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:29:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 13:29:28,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 13:29:28,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:28,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:28,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:29:28,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:29:28,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:29:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:29:28,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5007779] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:29:28,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:29:28,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:29:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991604554] [2025-02-08 13:29:28,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:29:28,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:29:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:28,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:29:28,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:29:28,685 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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:29:32,700 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:29:36,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:40,723 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:29:44,730 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 []