./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/printf-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:44:46,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:44:46,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 04:44:46,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:44:46,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:44:46,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:44:46,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:44:46,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:44:46,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:44:46,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:44:46,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:44:46,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:44:46,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:44:46,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:44:46,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:44:46,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:44:46,114 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 ! call(reach_error())) ) 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 -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-02-08 04:44:46,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:44:46,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:44:46,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:44:46,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:44:46,313 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:44:46,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-02-08 04:44:47,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be803e40/b5d27b69d4e94847b65409d532e3a1f8/FLAG4365c5649 [2025-02-08 04:44:47,961 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:44:47,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-02-08 04:44:47,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be803e40/b5d27b69d4e94847b65409d532e3a1f8/FLAG4365c5649 [2025-02-08 04:44:48,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be803e40/b5d27b69d4e94847b65409d532e3a1f8 [2025-02-08 04:44:48,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:44:48,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:44:48,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:44:48,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:44:48,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:44:48,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:44:48" (1/1) ... [2025-02-08 04:44:48,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11369eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:48, skipping insertion in model container [2025-02-08 04:44:48,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:44:48" (1/1) ... [2025-02-08 04:44:48,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:44:49,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103699,103712] [2025-02-08 04:44:49,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103875,103888] [2025-02-08 04:44:49,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104048,104061] [2025-02-08 04:44:49,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104259,104272] [2025-02-08 04:44:49,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104572,104585] [2025-02-08 04:44:49,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[106719,106732] [2025-02-08 04:44:49,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109080,109093] [2025-02-08 04:44:49,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109532,109545] [2025-02-08 04:44:49,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109885,109898] [2025-02-08 04:44:49,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[110424,110437] [2025-02-08 04:44:49,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111343,111356] [2025-02-08 04:44:49,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111696,111709] [2025-02-08 04:44:49,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112237,112250] [2025-02-08 04:44:49,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112970,112983] [2025-02-08 04:44:49,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:44:49,176 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:44:49,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103699,103712] [2025-02-08 04:44:49,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103875,103888] [2025-02-08 04:44:49,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104048,104061] [2025-02-08 04:44:49,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104259,104272] [2025-02-08 04:44:49,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104572,104585] [2025-02-08 04:44:49,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[106719,106732] [2025-02-08 04:44:49,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109080,109093] [2025-02-08 04:44:49,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109532,109545] [2025-02-08 04:44:49,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109885,109898] [2025-02-08 04:44:49,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[110424,110437] [2025-02-08 04:44:49,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111343,111356] [2025-02-08 04:44:49,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111696,111709] [2025-02-08 04:44:49,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112237,112250] [2025-02-08 04:44:49,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112970,112983] [2025-02-08 04:44:49,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:44:49,443 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 04:44:49,450 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:44:49,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49 WrapperNode [2025-02-08 04:44:49,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:44:49,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:44:49,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:44:49,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:44:49,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,548 INFO L138 Inliner]: procedures = 648, calls = 850, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1825 [2025-02-08 04:44:49,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:44:49,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:44:49,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:44:49,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:44:49,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,578 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 04:44:49,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:44:49,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:44:49,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:44:49,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:44:49,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (1/1) ... [2025-02-08 04:44:49,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:44:49,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:44:49,667 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 04:44:49,673 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 04:44:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 04:44:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-02-08 04:44:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 04:44:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-02-08 04:44:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-08 04:44:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-02-08 04:44:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-02-08 04:44:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 04:44:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-08 04:44:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-08 04:44:50,047 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:44:50,049 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:44:50,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-02-08 04:44:50,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: assume false; [2025-02-08 04:44:50,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: assume !false; [2025-02-08 04:44:50,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678: assume -9223372036854775808 <= conv_strtoull_#t~ret142#1 && conv_strtoull_#t~ret142#1 <= 9223372036854775807;conv_strtoull_~return_value_bb_strtoll$1~0#1 := conv_strtoull_#t~ret142#1;havoc conv_strtoull_#t~ret142#1; [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678-1: SUMMARY for call conv_strtoull_#t~ret142#1 := bb_strtoll(conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, 0, 0, 0); srcloc: null [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset;conv_strtoull_#t~ret140#1 := bb_strtoull_#res#1;havoc bb_strtoull_#t~mem103#1, bb_strtoull_#t~ret104#1, bb_strtoull_#t~ret105#1, bb_strtoull_#t~nondet106#1, bb_strtoull_#t~ret107#1, bb_strtoull_~arg#1.base, bb_strtoull_~arg#1.offset, bb_strtoull_~endp#1.base, bb_strtoull_~endp#1.offset, bb_strtoull_~base#1, bb_strtoull_~v~2#1, bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset, bb_strtoull_~return_value_bb_ascii_isalnum$2~0#1, bb_strtoull_~return_value_ret_ERANGE$1~0#1, bb_strtoull_~return_value_handle_errors$3~0#1;havoc bb_strtoull_#in~arg#1.base, bb_strtoull_#in~arg#1.offset, bb_strtoull_#in~endp#1.base, bb_strtoull_#in~endp#1.offset, bb_strtoull_#in~base#1;assume { :end_inline_bb_strtoull } true;call write~int(conv_strtoull_#t~ret140#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8);havoc conv_strtoull_#t~ret140#1;call conv_strtoull_#t~mem141#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: havoc conv_strtoull_#t~ret140#1, conv_strtoull_#t~mem141#1, conv_strtoull_#t~ret142#1, conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset;havoc conv_strtoull_#in~arg#1.base, conv_strtoull_#in~arg#1.offset, conv_strtoull_#in~result#1.base, conv_strtoull_#in~result#1.offset;assume { :end_inline_conv_strtoull } true; [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683: call write~int(conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8);havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3257: utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset := utoa_to_buf_#res#1.base, utoa_to_buf_#res#1.offset;havoc utoa_to_buf_~n#1, utoa_to_buf_~buf#1.base, utoa_to_buf_~buf#1.offset, utoa_to_buf_~buflen#1, utoa_to_buf_~i~0#1, utoa_to_buf_~out~0#1, utoa_to_buf_~res~0#1, utoa_to_buf_~tmp_post$1~1#1.base, utoa_to_buf_~tmp_post$1~1#1.offset;havoc utoa_to_buf_#in~n#1, utoa_to_buf_#in~buf#1.base, utoa_to_buf_#in~buf#1.offset, utoa_to_buf_#in~buflen#1;assume { :end_inline_utoa_to_buf } true;utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset := utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset;call write~int(0, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset, 1);utoa_#res#1.base, utoa_#res#1.offset := ~#local_buf~0.base, ~#local_buf~0.offset; [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !!(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 04:44:50,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1;havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 04:44:50,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !!(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1; [2025-02-08 04:44:50,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754: #t~ret156#1.base, #t~ret156#1.offset := utoa_#res#1.base, utoa_#res#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset, utoa_~n#1, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset;havoc utoa_#in~n#1;assume { :end_inline_utoa } true;~arg#1.base, ~arg#1.offset := #t~ret156#1.base, #t~ret156#1.offset;havoc #t~mem155#1;havoc #t~ret156#1.base, #t~ret156#1.offset; [2025-02-08 04:44:50,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret208#1; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret209#1; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume { :begin_inline_my_xstrtod } true;my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset := my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;call my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset := #Ultimate.allocOnStack(8); [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret214#1; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret215#1; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 04:44:50,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779-1: SUMMARY for call my_xstrtoll_#t~ret163#1 := multiconvert(my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, #funAddr~conv_strtoll.base, #funAddr~conv_strtoll.offset); srcloc: null [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: assume -2147483648 <= my_xstrtoll_#t~ret163#1 && my_xstrtoll_#t~ret163#1 <= 2147483647;my_xstrtoll_~return_value_multiconvert$1~0#1 := my_xstrtoll_#t~ret163#1;havoc my_xstrtoll_#t~ret163#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret206#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret207#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: assume -2147483648 <= my_xstrtoull_#t~ret165#1 && my_xstrtoull_#t~ret165#1 <= 2147483647;my_xstrtoull_~return_value_multiconvert$1~1#1 := my_xstrtoull_#t~ret165#1;havoc my_xstrtoull_#t~ret165#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788-1: SUMMARY for call my_xstrtoull_#t~ret165#1 := multiconvert(my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, #funAddr~conv_strtoull.base, #funAddr~conv_strtoull.offset); srcloc: null [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !(0 == my_xstrtoll_~return_value_multiconvert$1~0#1);call write~int(0, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8); [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !!(0 == my_xstrtoll_~return_value_multiconvert$1~0#1); [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: assume -2147483648 <= my_xstrtod_#t~ret161#1 && my_xstrtod_#t~ret161#1 <= 2147483647;havoc my_xstrtod_#t~ret161#1;call my_xstrtod_#t~mem162#1 := read~real(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, 8);my_xstrtod_#res#1 := my_xstrtod_#t~mem162#1;havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772-1: SUMMARY for call my_xstrtod_#t~ret161#1 := multiconvert(my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, #funAddr~conv_strtod.base, #funAddr~conv_strtod.offset); srcloc: null [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret212#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret213#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !(0 == my_xstrtoull_~return_value_multiconvert$1~1#1);call write~int(0, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8); [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !!(0 == my_xstrtoull_~return_value_multiconvert$1~1#1); [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;#t~ret211#1 := my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;havoc my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;assume { :end_inline_my_xstrtod } true;~dv~0#1 := #t~ret211#1;havoc #t~ret211#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: ~llv~0#1 := ~argument#1.base + ~argument#1.offset; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset;#t~ret205#1 := my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;havoc my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;assume { :end_inline_my_xstrtoll } true;assume -9223372036854775808 <= #t~ret205#1 && #t~ret205#1 <= 9223372036854775807;~llv~0#1 := #t~ret205#1;havoc #t~ret205#1; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782-2: call my_xstrtoll_#t~mem164#1 := read~int(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8);my_xstrtoll_#res#1 := my_xstrtoll_#t~mem164#1;havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-02-08 04:44:50,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: assume { :begin_inline_my_xstrtoll } true;my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset := my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;call my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoll_~return_value_multiconvert$1~0#1; [2025-02-08 04:44:50,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset;#t~ret210#1 := my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;havoc my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;assume { :end_inline_my_xstrtoull } true;~return_value_my_xstrtoull$2~0#1 := #t~ret210#1;havoc #t~ret210#1;~llv~0#1 := (if ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 else ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); [2025-02-08 04:44:50,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-2: call my_xstrtoull_#t~mem166#1 := read~int(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8);my_xstrtoull_#res#1 := my_xstrtoull_#t~mem166#1;havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-02-08 04:44:50,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: havoc ~return_value_my_xstrtoull$2~0#1;assume { :begin_inline_my_xstrtoull } true;my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset := my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;call my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoull_~return_value_multiconvert$1~1#1; [2025-02-08 04:44:50,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3252-1: safe_write_#res#1 := safe_write_~n~1#1; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume full_write_~cc~0#1 < 0; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume !(full_write_~cc~0#1 < 0);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 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: safe_write_#t~ret314#1 := write_#res#1;havoc write_#t~nondet355#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~ret314#1 && safe_write_#t~ret314#1 <= 9223372036854775807;safe_write_~n~1#1 := safe_write_#t~ret314#1;havoc safe_write_#t~ret314#1; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: 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~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#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~1#1;havoc safe_write_~tmp_if_expr$1~4#1; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: write_#res#1 := write_~ret~1#1; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394-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 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume safe_write_~n~1#1 < 0;call safe_write_#t~mem315#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~4#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem315#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume !(safe_write_~n~1#1 < 0);safe_write_~tmp_if_expr$1~4#1 := 0; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 04:44:50,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2635: #t~ret129#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet143#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret129#1 && #t~ret129#1 <= 2147483647;havoc #t~ret129#1;call #t~mem130#1.base, #t~mem130#1.offset := read~$Pointer$(~#msg~0#1.base, ~#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, #t~mem130#1.base, #t~mem130#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret144#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 04:44:50,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636: #t~ret131#1 := full_write_#res#1;havoc full_write_#t~ret144#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 <= #t~ret131#1 && #t~ret131#1 <= 9223372036854775807;havoc #t~mem130#1.base, #t~mem130#1.offset;havoc #t~ret131#1; [2025-02-08 04:44:50,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: full_write_#t~ret144#1 := safe_write_#res#1;havoc safe_write_#t~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#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~ret144#1 && full_write_#t~ret144#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret144#1;havoc full_write_#t~ret144#1; [2025-02-08 04:44:50,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume 0 != safe_write_~tmp_if_expr$1~4#1 % 256; [2025-02-08 04:44:50,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume !(0 != safe_write_~tmp_if_expr$1~4#1 % 256); [2025-02-08 04:44:50,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: 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~nondet355#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~nondet355#1;assume -9223372036854775808 <= write_#t~nondet355#1 && write_#t~nondet355#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet355#1;havoc write_#t~nondet355#1; [2025-02-08 04:44:50,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: assume !true; [2025-02-08 04:44:56,369 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-02-08 04:44:56,370 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset);call __main_#t~mem311#1.base, __main_#t~mem311#1.offset := read~$Pointer$(__main_~argv2~0#1.base, __main_~argv2~0#1.offset, 8);__main_~tmp_if_expr$2~1#1 := (if 0 == (if 0 != (if __main_#t~mem311#1.base != 0 || __main_#t~mem311#1.offset != 0 then 1 else 0) then 1 else 0) then 0 else 1);havoc __main_#t~mem311#1.base, __main_#t~mem311#1.offset; [2025-02-08 04:44:56,370 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !!(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset);__main_~tmp_if_expr$2~1#1 := 0; [2025-02-08 04:44:56,370 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset;__main_#t~ret310#1.base, __main_#t~ret310#1.offset := print_formatted_#res#1.base, print_formatted_#res#1.offset;havoc print_formatted_#t~mem222#1.base, print_formatted_#t~mem222#1.offset, print_formatted_#t~mem223#1, print_formatted_#t~mem224#1.base, print_formatted_#t~mem224#1.offset, print_formatted_#t~mem225#1, print_formatted_#t~mem226#1.base, print_formatted_#t~mem226#1.offset, print_formatted_#t~mem227#1, print_formatted_#t~mem228#1.base, print_formatted_#t~mem228#1.offset, print_formatted_#t~mem229#1.base, print_formatted_#t~mem229#1.offset, print_formatted_#t~mem230#1.base, print_formatted_#t~mem230#1.offset, print_formatted_#t~mem231#1, print_formatted_#t~ret232#1, print_formatted_#t~mem233#1.base, print_formatted_#t~mem233#1.offset, print_formatted_#t~mem234#1, print_formatted_#t~mem235#1.base, print_formatted_#t~mem235#1.offset, print_formatted_#t~mem236#1.base, print_formatted_#t~mem236#1.offset, print_formatted_#t~mem237#1.base, print_formatted_#t~mem237#1.offset, print_formatted_#t~mem238#1, print_formatted_#t~nondet239#1.base, print_formatted_#t~nondet239#1.offset, print_formatted_#t~mem240#1.base, print_formatted_#t~mem240#1.offset, print_formatted_#t~mem241#1, print_formatted_#t~mem242#1.base, print_formatted_#t~mem242#1.offset, print_formatted_#t~mem243#1.base, print_formatted_#t~mem243#1.offset, print_formatted_#t~mem244#1, print_formatted_#t~mem245#1.base, print_formatted_#t~mem245#1.offset, print_formatted_#t~mem246#1.base, print_formatted_#t~mem246#1.offset, print_formatted_#t~mem247#1.base, print_formatted_#t~mem247#1.offset, print_formatted_#t~ret248#1, print_formatted_#t~mem249#1.base, print_formatted_#t~mem249#1.offset, print_formatted_#t~mem250#1, print_formatted_#t~mem251#1.base, print_formatted_#t~mem251#1.offset, print_formatted_#t~mem252#1.base, print_formatted_#t~mem252#1.offset, print_formatted_#t~mem253#1, print_formatted_#t~mem254#1.base, print_formatted_#t~mem254#1.offset, print_formatted_#t~mem255#1.base, print_formatted_#t~mem255#1.offset, print_formatted_#t~mem256#1, print_formatted_#t~mem257#1.base, print_formatted_#t~mem257#1.offset, print_formatted_#t~mem258#1.base, print_formatted_#t~mem258#1.offset, print_formatted_#t~mem259#1.base, print_formatted_#t~mem259#1.offset, print_formatted_#t~ret260#1, print_formatted_#t~mem261#1.base, print_formatted_#t~mem261#1.offset, print_formatted_#t~mem262#1, print_formatted_#t~mem263#1.base, print_formatted_#t~mem263#1.offset, print_formatted_#t~mem264#1.base, print_formatted_#t~mem264#1.offset, print_formatted_#t~mem265#1, print_formatted_#t~bitwise266#1, print_formatted_#t~mem267#1.base, print_formatted_#t~mem267#1.offset, print_formatted_#t~mem268#1, print_formatted_#t~mem269#1.base, print_formatted_#t~mem269#1.offset, print_formatted_#t~mem270#1, print_formatted_#t~mem271#1.base, print_formatted_#t~mem271#1.offset, print_formatted_#t~mem272#1.base, print_formatted_#t~mem272#1.offset, print_formatted_#t~mem273#1.base, print_formatted_#t~mem273#1.offset, print_formatted_#t~mem274#1, print_formatted_#t~nondet275#1.base, print_formatted_#t~nondet275#1.offset, print_formatted_#t~mem276#1.base, print_formatted_#t~mem276#1.offset, print_formatted_#t~mem277#1, print_formatted_#t~short278#1, print_formatted_#t~varargs279#1.base, print_formatted_#t~varargs279#1.offset, print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset, print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset, print_formatted_#t~mem282#1, print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset, print_formatted_#t~mem283#1.base, print_formatted_#t~mem283#1.offset, print_formatted_#t~mem284#1.base, print_formatted_#t~mem284#1.offset, print_formatted_#t~mem285#1, print_formatted_#t~mem286#1, print_formatted_#t~bitwise287#1, print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset, print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, print_formatted_#t~mem290#1, print_formatted_#t~ret291#1, print_formatted_#t~ret292#1, print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset, print_formatted_#t~mem294#1.base, print_formatted_#t~mem294#1.offset, print_formatted_#t~mem295#1, print_formatted_#t~nondet296#1, print_formatted_#t~mem297#1.base, print_formatted_#t~mem297#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, print_formatted_~argv#1.base, print_formatted_~argv#1.offset, print_formatted_~conv_err#1.base, print_formatted_~conv_err#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1, print_formatted_~field_width~0#1, print_formatted_~precision~0#1, print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset, print_formatted_~tmp_post$1~0#1.base, print_formatted_~tmp_post$1~0#1.offset, print_formatted_~return_value___builtin_strchr$2~0#1.base, print_formatted_~return_value___builtin_strchr$2~0#1.offset, print_formatted_~tmp_post$3~0#1.base, print_formatted_~tmp_post$3~0#1.offset, print_formatted_~tmp_post$4~0#1.base, print_formatted_~tmp_post$4~0#1.offset, print_formatted_~tmp_post$7~1#1.base, print_formatted_~tmp_post$7~1#1.offset, print_formatted_~return_value_bb_process_escape_sequence$8~0#1;havoc print_formatted_#in~f#1.base, print_formatted_#in~f#1.offset, print_formatted_#in~argv#1.base, print_formatted_#in~argv#1.offset, print_formatted_#in~conv_err#1.base, print_formatted_#in~conv_err#1.offset;assume { :end_inline_print_formatted } true;__main_~argv2~0#1.base, __main_~argv2~0#1.offset := __main_#t~ret310#1.base, __main_#t~ret310#1.offset;havoc __main_#t~ret310#1.base, __main_#t~ret310#1.offset; [2025-02-08 04:44:56,370 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: call print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call write~$Pointer$(print_formatted_#t~mem288#1.base, 1 + print_formatted_#t~mem288#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);havoc print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset;call print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call print_formatted_#t~mem290#1 := read~int(print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, 1); [2025-02-08 04:44:56,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset := xmalloc_#res#1.base, xmalloc_#res#1.offset;havoc xmalloc_#t~malloc318#1.base, xmalloc_#t~malloc318#1.offset, xmalloc_#t~varargs319#1.base, xmalloc_#t~varargs319#1.offset, xmalloc_~size#1, xmalloc_~ptr~0#1.base, xmalloc_~ptr~0#1.offset;havoc xmalloc_#in~size#1;assume { :end_inline_xmalloc } true;print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset := print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;havoc print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset := print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset;assume { :begin_inline_#Ultimate.C_memcpy } true;#Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1 := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1 % 4294967296;havoc #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;#Ultimate.C_memcpy_#t~loopctr374#1 := 0; [2025-02-08 04:44:56,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume 99 == print_formatted_#t~mem290#1;havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1;print_formatted_#res#1.base, print_formatted_#res#1.offset := print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset;call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-02-08 04:44:56,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !(99 == print_formatted_#t~mem290#1);havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1; [2025-02-08 04:44:56,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset := read~unchecked~$Pointer$(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);call write~unchecked~$Pointer$(#Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);#Ultimate.C_memcpy_#t~loopctr381#1 := 8 + #Ultimate.C_memcpy_#t~loopctr381#1; [2025-02-08 04:44:56,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);assume #Ultimate.C_memcpy_#res#1.base == #Ultimate.C_memcpy_dest#1.base && #Ultimate.C_memcpy_#res#1.offset == #Ultimate.C_memcpy_dest#1.offset;print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset := #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;havoc #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1;assume { :end_inline_#Ultimate.C_memcpy } true;havoc print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset;call print_formatted_#t~mem282#1 := read~int(print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);call write~int(print_formatted_#t~mem282#1, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 else (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);havoc print_formatted_#t~mem282#1;call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 else print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);print_formatted_~direc_length~0#1 := 2 + print_formatted_~direc_length~0#1;print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset;havoc print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset; [2025-02-08 04:44:56,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume #Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem375#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem376#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call #Ultimate.C_memcpy_#t~mem377#1 := read~unchecked~real(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~real(#Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem378#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem379#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);call #Ultimate.C_memcpy_#t~mem380#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);#Ultimate.C_memcpy_#t~loopctr374#1 := 1 + #Ultimate.C_memcpy_#t~loopctr374#1; [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume !(#Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);#Ultimate.C_memcpy_#t~loopctr381#1 := 0; [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume 0 != __main_~tmp_if_expr$2~1#1 % 256; [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume !(0 != __main_~tmp_if_expr$2~1#1 % 256); [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172: assume -128 <= print_formatted_#t~ret291#1 && print_formatted_#t~ret291#1 <= 127;print_formatted_~return_value_bb_process_escape_sequence$8~0#1 := print_formatted_#t~ret291#1;havoc print_formatted_#t~ret291#1; [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172-1: SUMMARY for call print_formatted_#t~ret291#1 := bb_process_escape_sequence(print_formatted_~#f#1.base, print_formatted_~#f#1.offset); srcloc: null [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173-1: SUMMARY for call print_formatted_#t~ret292#1 := bb_putchar(print_formatted_~return_value_bb_process_escape_sequence$8~0#1); srcloc: null [2025-02-08 04:44:56,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume -2147483648 <= print_formatted_#t~ret292#1 && print_formatted_#t~ret292#1 <= 2147483647;havoc print_formatted_#t~ret292#1;call print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call write~$Pointer$(print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset - 1, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);havoc print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset; [2025-02-08 04:44:56,452 INFO L? ?]: Removed 480 outVars from TransFormulas that were not future-live. [2025-02-08 04:44:56,453 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:44:56,477 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:44:56,477 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 04:44:56,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:44:56 BoogieIcfgContainer [2025-02-08 04:44:56,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:44:56,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:44:56,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:44:56,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:44:56,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:44:48" (1/3) ... [2025-02-08 04:44:56,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430a2eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:44:56, skipping insertion in model container [2025-02-08 04:44:56,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:49" (2/3) ... [2025-02-08 04:44:56,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430a2eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:44:56, skipping insertion in model container [2025-02-08 04:44:56,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:44:56" (3/3) ... [2025-02-08 04:44:56,487 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-02-08 04:44:56,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:44:56,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 14 procedures, 366 locations, 1 initial locations, 23 loop locations, and 16 error locations. [2025-02-08 04:44:56,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:44:56,560 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;@2aa326f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:44:56,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 04:44:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 319 states, 254 states have (on average 1.5669291338582678) internal successors, (398), 277 states have internal predecessors, (398), 28 states have call successors, (28), 11 states have call predecessors, (28), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-08 04:44:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 04:44:56,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:44:56,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:44:56,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:44:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:44:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2034691097, now seen corresponding path program 1 times [2025-02-08 04:44:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:44:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006754316] [2025-02-08 04:44:56,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:44:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:44:57,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 04:44:57,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 04:44:57,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:44:57,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:44:57,851 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 04:44:57,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:44:57,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006754316] [2025-02-08 04:44:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006754316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:44:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:44:57,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:44:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738536689] [2025-02-08 04:44:57,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:44:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:44:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:44:57,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:44:57,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:44:57,875 INFO L87 Difference]: Start difference. First operand has 319 states, 254 states have (on average 1.5669291338582678) internal successors, (398), 277 states have internal predecessors, (398), 28 states have call successors, (28), 11 states have call predecessors, (28), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:44:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:44:57,963 INFO L93 Difference]: Finished difference Result 552 states and 811 transitions. [2025-02-08 04:44:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:44:57,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-08 04:44:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:44:57,972 INFO L225 Difference]: With dead ends: 552 [2025-02-08 04:44:57,972 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 04:44:57,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:44:57,979 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:44:57,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:44:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 04:44:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-08 04:44:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 165 states have internal predecessors, (214), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:44:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2025-02-08 04:44:58,023 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 24 [2025-02-08 04:44:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:44:58,024 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2025-02-08 04:44:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:44:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2025-02-08 04:44:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 04:44:58,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:44:58,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:44:58,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:44:58,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:44:58,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:44:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1703586136, now seen corresponding path program 1 times [2025-02-08 04:44:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:44:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720206757] [2025-02-08 04:44:58,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:44:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:44:58,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 04:44:58,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 04:44:58,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:44:58,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:44:59,031 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 04:44:59,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:44:59,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720206757] [2025-02-08 04:44:59,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720206757] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:44:59,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849428697] [2025-02-08 04:44:59,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:44:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:44:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:44:59,035 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 04:44:59,040 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 04:45:00,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 04:45:00,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 04:45:00,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:00,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:00,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1909 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 04:45:00,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:00,550 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 04:45:00,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:45:00,605 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 04:45:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849428697] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:45:00,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:45:00,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 04:45:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256922653] [2025-02-08 04:45:00,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:45:00,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:00,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:00,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:00,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:00,607 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:00,662 INFO L93 Difference]: Finished difference Result 372 states and 488 transitions. [2025-02-08 04:45:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:00,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-08 04:45:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:00,672 INFO L225 Difference]: With dead ends: 372 [2025-02-08 04:45:00,672 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 04:45:00,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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 04:45:00,673 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:00,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 950 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 04:45:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-08 04:45:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.391025641025641) internal successors, (217), 168 states have internal predecessors, (217), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:45:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2025-02-08 04:45:00,681 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 25 [2025-02-08 04:45:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:00,681 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2025-02-08 04:45:00,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2025-02-08 04:45:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 04:45:00,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:00,682 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:45:00,692 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 04:45:00,882 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 04:45:00,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:45:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1838905976, now seen corresponding path program 2 times [2025-02-08 04:45:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759996042] [2025-02-08 04:45:00,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:45:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:01,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 04:45:01,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-02-08 04:45:01,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:45:01,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 04:45:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759996042] [2025-02-08 04:45:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759996042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:01,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:45:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175262394] [2025-02-08 04:45:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:01,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:45:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:01,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:45:01,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:01,850 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:02,037 INFO L93 Difference]: Finished difference Result 207 states and 263 transitions. [2025-02-08 04:45:02,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:02,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-08 04:45:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:02,039 INFO L225 Difference]: With dead ends: 207 [2025-02-08 04:45:02,039 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 04:45:02,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:45:02,039 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 19 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:02,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1173 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 04:45:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2025-02-08 04:45:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.38125) internal successors, (221), 171 states have internal predecessors, (221), 18 states have call successors, (18), 10 states have call predecessors, (18), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:45:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2025-02-08 04:45:02,060 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 28 [2025-02-08 04:45:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:02,060 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2025-02-08 04:45:02,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2025-02-08 04:45:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 04:45:02,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:02,061 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:45:02,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:45:02,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:45:02,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1838935767, now seen corresponding path program 1 times [2025-02-08 04:45:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178150814] [2025-02-08 04:45:02,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:02,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 04:45:02,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 04:45:02,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:02,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:03,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:03,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178150814] [2025-02-08 04:45:03,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178150814] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:03,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627301736] [2025-02-08 04:45:03,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:03,006 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 04:45:03,008 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 04:45:03,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 04:45:04,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 04:45:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:04,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1965 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 04:45:04,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:04,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:45:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627301736] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:45:04,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:45:04,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-02-08 04:45:04,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944923096] [2025-02-08 04:45:04,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:45:04,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 04:45:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:04,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 04:45:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:45:04,217 INFO L87 Difference]: Start difference. First operand 194 states and 251 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:04,263 INFO L93 Difference]: Finished difference Result 388 states and 507 transitions. [2025-02-08 04:45:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 04:45:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-08 04:45:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:04,265 INFO L225 Difference]: With dead ends: 388 [2025-02-08 04:45:04,265 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 04:45:04,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:45:04,266 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:04,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 713 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 04:45:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 04:45:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 166 states have (on average 1.3674698795180722) internal successors, (227), 177 states have internal predecessors, (227), 18 states have call successors, (18), 10 states have call predecessors, (18), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:45:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2025-02-08 04:45:04,280 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 28 [2025-02-08 04:45:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:04,280 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2025-02-08 04:45:04,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2025-02-08 04:45:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 04:45:04,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:04,284 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:04,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 04:45:04,484 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 04:45:04,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:45:04,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1507033815, now seen corresponding path program 2 times [2025-02-08 04:45:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132210193] [2025-02-08 04:45:04,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:45:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:05,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-08 04:45:05,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 34 statements. [2025-02-08 04:45:05,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:45:05,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132210193] [2025-02-08 04:45:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132210193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:45:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630373671] [2025-02-08 04:45:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:05,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:45:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:05,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:45:05,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:05,596 INFO L87 Difference]: Start difference. First operand 200 states and 257 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:09,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:13,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:13,835 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2025-02-08 04:45:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-02-08 04:45:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:13,837 INFO L225 Difference]: With dead ends: 382 [2025-02-08 04:45:13,837 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 04:45:13,838 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 04:45:13,838 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 85 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:13,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 923 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-08 04:45:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 04:45:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2025-02-08 04:45:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 167 states have (on average 1.3652694610778444) internal successors, (228), 178 states have internal predecessors, (228), 18 states have call successors, (18), 10 states have call predecessors, (18), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:45:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 258 transitions. [2025-02-08 04:45:13,846 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 258 transitions. Word has length 34 [2025-02-08 04:45:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 258 transitions. [2025-02-08 04:45:13,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 258 transitions. [2025-02-08 04:45:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 04:45:13,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:13,847 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:45:13,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:45:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2125216469, now seen corresponding path program 1 times [2025-02-08 04:45:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582380031] [2025-02-08 04:45:13,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:14,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 04:45:14,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 04:45:14,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:14,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:14,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582380031] [2025-02-08 04:45:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582380031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:14,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193973665] [2025-02-08 04:45:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:14,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:14,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:14,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:14,597 INFO L87 Difference]: Start difference. First operand 201 states and 258 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:18,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:18,682 INFO L93 Difference]: Finished difference Result 384 states and 498 transitions. [2025-02-08 04:45:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-02-08 04:45:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:18,692 INFO L225 Difference]: With dead ends: 384 [2025-02-08 04:45:18,692 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 04:45:18,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:18,693 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:18,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 04:45:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 04:45:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 04:45:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 179 states have internal predecessors, (229), 18 states have call successors, (18), 10 states have call predecessors, (18), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:45:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2025-02-08 04:45:18,703 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 36 [2025-02-08 04:45:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:18,703 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2025-02-08 04:45:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2025-02-08 04:45:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 04:45:18,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:18,705 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:18,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:45:18,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:45:18,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash -511617962, now seen corresponding path program 1 times [2025-02-08 04:45:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389461060] [2025-02-08 04:45:18,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:19,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 04:45:19,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 04:45:19,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:19,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:19,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389461060] [2025-02-08 04:45:19,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389461060] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:19,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252237401] [2025-02-08 04:45:19,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:19,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:19,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:19,461 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 04:45:19,464 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 04:45:20,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 04:45:20,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 04:45:20,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:20,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:20,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 04:45:20,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:20,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:45:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252237401] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:45:20,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:45:20,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 04:45:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092619596] [2025-02-08 04:45:20,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:45:20,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:20,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:20,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:20,649 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:24,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:28,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:32,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:36,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:40,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:45:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:40,795 INFO L93 Difference]: Finished difference Result 388 states and 504 transitions. [2025-02-08 04:45:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-02-08 04:45:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:40,797 INFO L225 Difference]: With dead ends: 388 [2025-02-08 04:45:40,797 INFO L226 Difference]: Without dead ends: 205 [2025-02-08 04:45:40,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 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 04:45:40,798 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:40,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 711 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-02-08 04:45:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-08 04:45:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-08 04:45:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 171 states have (on average 1.3567251461988303) internal successors, (232), 182 states have internal predecessors, (232), 18 states have call successors, (18), 10 states have call predecessors, (18), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:45:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2025-02-08 04:45:40,803 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 37 [2025-02-08 04:45:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:40,804 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2025-02-08 04:45:40,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 04:45:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2025-02-08 04:45:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 04:45:40,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:40,805 INFO L218 NwaCegarLoop]: trace histogram [10, 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 04:45:40,816 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 04:45:41,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:41,006 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-08 04:45:41,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash 401019669, now seen corresponding path program 2 times [2025-02-08 04:45:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:41,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553311164] [2025-02-08 04:45:41,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:45:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:41,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 04:45:41,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 04:45:41,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 04:45:41,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:41,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553311164] [2025-02-08 04:45:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553311164] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66152217] [2025-02-08 04:45:41,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:45:41,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:41,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:41,981 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 04:45:41,983 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 04:45:42,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.