./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/fold-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/fold-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51ce4c2757de3991b684be886f7ff20d2b698c1c8e1eb6aea3e56905f1085bd5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:26:11,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:26:11,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:26:11,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:26:11,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:26:11,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:26:11,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:26:11,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:26:11,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:26:11,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:26:11,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:26:11,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:26:11,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:26:11,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:26:11,397 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:26:11,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:26:11,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:26:11,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:26:11,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:26:11,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:26:11,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:26:11,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:26:11,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:26:11,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:26:11,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:11,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:26:11,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:26:11,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:26:11,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:26:11,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:26:11,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:26:11,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:26:11,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:26:11,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:26:11,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:26:11,401 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51ce4c2757de3991b684be886f7ff20d2b698c1c8e1eb6aea3e56905f1085bd5 [2025-02-08 13:26:11,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:26:11,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:26:11,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:26:11,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:26:11,658 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:26:11,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/fold-2.i [2025-02-08 13:26:12,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e6283b52/ed1ddc718cfd48c69e5ce1a7bf0e83ba/FLAG1359beecf [2025-02-08 13:26:13,241 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:26:13,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/fold-2.i [2025-02-08 13:26:13,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e6283b52/ed1ddc718cfd48c69e5ce1a7bf0e83ba/FLAG1359beecf [2025-02-08 13:26:13,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e6283b52/ed1ddc718cfd48c69e5ce1a7bf0e83ba [2025-02-08 13:26:13,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:26:13,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:26:13,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:13,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:26:13,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:26:13,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:13" (1/1) ... [2025-02-08 13:26:13,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6a3e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:13, skipping insertion in model container [2025-02-08 13:26:13,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:13" (1/1) ... [2025-02-08 13:26:13,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:26:14,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:14,217 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:26:14,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:14,511 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:26:14,518 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:26:14,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14 WrapperNode [2025-02-08 13:26:14,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:14,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:14,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:26:14,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:26:14,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,659 INFO L138 Inliner]: procedures = 581, calls = 798, calls flagged for inlining = 28, calls inlined = 26, statements flattened = 2137 [2025-02-08 13:26:14,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:14,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:26:14,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:26:14,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:26:14,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,746 INFO L175 MemorySlicer]: Split 645 memory accesses to 23 slices as follows [2, 7, 3, 34, 25, 16, 2, 10, 3, 22, 17, 1, 3, 2, 17, 355, 65, 1, 3, 3, 44, 4, 6]. 55 percent of accesses are in the largest equivalence class. The 389 initializations are split as follows [2, 0, 3, 5, 9, 0, 2, 1, 0, 0, 0, 0, 0, 0, 4, 355, 8, 0, 0, 0, 0, 0, 0]. The 116 writes are split as follows [0, 7, 0, 0, 15, 1, 0, 5, 0, 5, 17, 1, 3, 1, 4, 0, 39, 1, 0, 0, 12, 1, 4]. [2025-02-08 13:26:14,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:26:14,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:26:14,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:26:14,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:26:14,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:14,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:14,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:26:14,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:26:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:26:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:26:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:26:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:26:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:26:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:26:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-02-08 13:26:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#22 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:26:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#22 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure adjust_column [2025-02-08 13:26:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure adjust_column [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:26:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:26:14,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:26:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:26:14,962 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:26:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:26:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 13:26:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 13:26:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:26:14,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:26:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:26:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#22 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:26:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#22 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure write2stdout [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure write2stdout [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:26:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:26:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:26:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:26:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 13:26:14,974 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-02-08 13:26:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-02-08 13:26:14,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:26:14,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:26:14,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-02-08 13:26:14,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:26:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:26:14,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:26:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#0 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#1 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#2 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#3 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#4 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#5 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#6 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#7 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#8 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#9 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#10 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#11 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#12 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#13 [2025-02-08 13:26:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#14 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#15 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#16 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#17 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#18 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#19 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#20 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#21 [2025-02-08 13:26:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#22 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#0 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#1 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#2 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#3 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#4 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#5 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#6 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#7 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#8 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#9 [2025-02-08 13:26:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#10 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#11 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#12 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#13 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#14 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#15 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#16 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#17 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#18 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#19 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#20 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#21 [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#22 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure xatou_range [2025-02-08 13:26:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure xatou_range [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:26:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:26:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 13:26:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-08 13:26:15,502 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:26:15,505 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:26:16,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem236#1 := read~int#7(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem236#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:26:16,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:26:16,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282: write_#res#1 := write_~ret~1#1; [2025-02-08 13:26:16,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:26:16,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: 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~ret235#1, safe_write_#t~mem236#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~2#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~2#1; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608: full_write_#t~ret111#1 := safe_write_#res#1;havoc safe_write_#t~ret235#1, safe_write_#t~mem236#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~2#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~ret111#1 && full_write_#t~ret111#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret111#1;havoc full_write_#t~ret111#1; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394: #t~ret67#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet76#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret67#1 && #t~ret67#1 <= 2147483647;havoc #t~ret67#1;call #t~mem68#1.base, #t~mem68#1.offset := read~$Pointer$#5(~#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~mem68#1.base, #t~mem68#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret111#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2609: assume full_write_~cc~0#1 < 0; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2609: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072: 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~nondet299#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~nondet299#1;assume -9223372036854775808 <= write_#t~nondet299#1 && write_#t~nondet299#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet299#1;havoc write_#t~nondet299#1; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072: assume !true; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2395: #t~ret69#1 := full_write_#res#1;havoc full_write_#t~ret111#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~ret69#1 && #t~ret69#1 <= 9223372036854775807;havoc #t~mem68#1.base, #t~mem68#1.offset;havoc #t~ret69#1; [2025-02-08 13:26:16,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:26:16,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2611: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:16,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2611: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:26:16,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074: safe_write_#t~ret235#1 := write_#res#1;havoc write_#t~nondet299#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~ret235#1 && safe_write_#t~ret235#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret235#1;havoc safe_write_#t~ret235#1; [2025-02-08 13:26:16,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3200: havoc xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset; [2025-02-08 13:26:16,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3200-2: call xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#1(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset, 8);call write~int#1(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs262#1.base, 8 + xstrtou_range_sfx_#t~varargs262#1.offset, 8);call write~int#1(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs262#1.base, 16 + xstrtou_range_sfx_#t~varargs262#1.offset, 8); [2025-02-08 13:26:16,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3200-1: SUMMARY for call bb_error_msg_and_die(13, 0, xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset); srcloc: null [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3167: xstrtou_range_sfx_#t~ret252#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet45#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~2#1 := xstrtou_range_sfx_#t~ret252#1;havoc xstrtou_range_sfx_#t~ret252#1;call xstrtou_range_sfx_#t~mem253#1.base, xstrtou_range_sfx_#t~mem253#1.offset := read~$Pointer$#18(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3176: havoc xstrtou_range_sfx_~__s1_len~0#1;havoc xstrtou_range_sfx_~__s2_len~0#1;havoc xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;call xstrtou_range_sfx_#t~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset := read~$Pointer$#18(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet257#1;havoc xstrtou_range_sfx_#t~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset;havoc xstrtou_range_sfx_#t~nondet257#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: assume true;call xstrtou_range_sfx_#t~mem255#1 := read~int#19(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: assume !true; [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-1: assume !(0 == xstrtou_range_sfx_#t~mem255#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem255#1; [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-1: assume !!(0 == xstrtou_range_sfx_#t~mem255#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem255#1; [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume 0 == xstrtou_range_sfx_#t~mem254#1;havoc xstrtou_range_sfx_#t~mem254#1;call write~int#7(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !(0 == xstrtou_range_sfx_#t~mem254#1);havoc xstrtou_range_sfx_#t~mem254#1; [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem253#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem253#1.offset);havoc xstrtou_range_sfx_#t~mem253#1.base, xstrtou_range_sfx_#t~mem253#1.offset;call xstrtou_range_sfx_#t~mem254#1 := read~int#7(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem253#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem253#1.offset);havoc xstrtou_range_sfx_#t~mem253#1.base, xstrtou_range_sfx_#t~mem253#1.offset; [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~2#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296); [2025-02-08 13:26:16,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3193: assume xstrtou_range_sfx_~r~2#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3193: assume !(xstrtou_range_sfx_~r~2#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189-1: call xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset := read~$Pointer$#18(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem261#1 := read~int#16(xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset, 1); [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189: assume 0 == xstrtou_range_sfx_#t~mem261#1;havoc xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset;havoc xstrtou_range_sfx_#t~mem261#1; [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189: assume !(0 == xstrtou_range_sfx_#t~mem261#1);havoc xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset;havoc xstrtou_range_sfx_#t~mem261#1; [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3183: assume !(4294967295 / (xstrtou_range_sfx_#t~mem258#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem258#1; [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3183: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem258#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem258#1;call xstrtou_range_sfx_#t~mem259#1 := read~int#19(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~2#1 := xstrtou_range_sfx_~r~2#1 * xstrtou_range_sfx_#t~mem259#1;havoc xstrtou_range_sfx_#t~mem259#1; [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3181: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem258#1 := read~int#19(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3181: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:26:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:26:21,612 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513-1: SUMMARY for call __main_#t~ret96#1 := adjust_column(__main_~column~0#1, (if __main_~c~0#1 % 256 <= 127 then __main_~c~0#1 % 256 else __main_~c~0#1 % 256 - 256)); srcloc: null [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: assume -2147483648 <= __main_#t~ret96#1 && __main_#t~ret96#1 <= 2147483647;__main_~return_value_adjust_column$2~0#1 := __main_#t~ret96#1;havoc __main_#t~ret96#1;__main_~column~0#1 := __main_~return_value_adjust_column$2~0#1; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944-1: assume true; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944-1: assume !true; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: assume -2147483648 <= __main_#t~ret102#1 && __main_#t~ret102#1 <= 2147483647;__main_~return_value_adjust_column$4~0#1 := __main_#t~ret102#1;havoc __main_#t~mem101#1;havoc __main_#t~ret102#1;__main_~column~0#1 := __main_~return_value_adjust_column$4~0#1;havoc __main_~return_value_adjust_column$4~0#1;__main_~fold_main$$1$$2$$2$$4$$i~0#1 := 1 + __main_~fold_main$$1$$2$$2$$4$$i~0#1; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2482: __main_#t~ret93#1.base, __main_#t~ret93#1.offset := fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem108#1, fopen_or_warn_stdin_#t~mem109#1, fopen_or_warn_stdin_#t~ret110#1.base, fopen_or_warn_stdin_#t~ret110#1.offset, fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset, fopen_or_warn_stdin_~tmp_if_expr$1~0#1;havoc fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset;assume { :end_inline_fopen_or_warn_stdin } true;__main_~istream~0#1.base, __main_~istream~0#1.offset := __main_#t~ret93#1.base, __main_#t~ret93#1.offset;havoc __main_#t~mem92#1.base, __main_#t~mem92#1.offset;havoc __main_#t~ret93#1.base, __main_#t~ret93#1.offset;havoc __main_~c~0#1;__main_~column~0#1 := 0;__main_~offset_out~0#1 := 0; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548-1: SUMMARY for call __main_#t~ret102#1 := adjust_column(__main_~column~0#1, __main_#t~mem101#1); srcloc: null [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: assume !(__main_~width~0#1 % 4294967296 >= __main_~column~0#1 % 4294967296); [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: assume !!(__main_~width~0#1 % 4294967296 >= __main_~column~0#1 % 4294967296);__main_~offset_out~0#1 := 1 + __main_~offset_out~0#1; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517: assume 0 == __main_~offset_out~0#1 % 4294967296; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517: assume !(0 == __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2947: assume -1 == getopt32_~c~1#1; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2947: assume !(-1 == getopt32_~c~1#1);getopt32_~c~1#1 := getopt32_~c~1#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset;havoc xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212-1: SUMMARY for call xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: assume __main_~istream~0#1.base == 0 && __main_~istream~0#1.offset == 0;__main_~exitcode~0#1 := 1; [2025-02-08 13:26:21,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: assume !(__main_~istream~0#1.base == 0 && __main_~istream~0#1.offset == 0); [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3213-1: SUMMARY for call xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#1.offset := #Ultimate.C_memset#16(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3213: havoc xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: assume true;call getopt32_#t~mem189#1 := read~int#20(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: assume !true; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951-2: assume !!((if getopt32_#t~mem189#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem189#1 % 256 % 4294967296 else getopt32_#t~mem189#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~1#1);havoc getopt32_#t~mem189#1; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951-2: assume !((if getopt32_#t~mem189#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem189#1 % 256 % 4294967296 else getopt32_#t~mem189#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~1#1);havoc getopt32_#t~mem189#1;call getopt32_#t~mem190#1 := read~int#20(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: call write~int#22(10, __main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 else __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2489: havoc __main_~return_value_fclose_if_not_stdin$5~0#1; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume 0 == (if getopt32_#t~mem190#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem190#1 % 256 % 4294967296 else getopt32_#t~mem190#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem190#1; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume !(0 == (if getopt32_#t~mem190#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem190#1 % 256 % 4294967296 else getopt32_#t~mem190#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem190#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556: __main_~offset_out~0#1 := 0;__main_~column~0#1 := __main_~offset_out~0#1; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: assume true;assume { :begin_inline__IO_getc } true;_IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset := __main_~istream~0#1.base, __main_~istream~0#1.offset;havoc _IO_getc_#res#1;havoc _IO_getc_#t~nondet266#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;_IO_getc_~stream#1.base, _IO_getc_~stream#1.offset := _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume -2147483648 <= _IO_getc_#t~nondet266#1 && _IO_getc_#t~nondet266#1 <= 2147483647;_IO_getc_#res#1 := _IO_getc_#t~nondet266#1;havoc _IO_getc_#t~nondet266#1; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: assume !true; [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556-1: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, 1 + __main_~offset_out~0#1); srcloc: null [2025-02-08 13:26:21,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490-1: assume true; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490-1: assume !true; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: havoc _IO_getc_#t~nondet266#1;__main_#t~ret94#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet266#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;havoc _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume { :end_inline__IO_getc } true;assume -2147483648 <= __main_#t~ret94#1 && __main_#t~ret94#1 <= 2147483647;__main_~c~0#1 := __main_#t~ret94#1;havoc __main_#t~ret94#1; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: assume 0 != getopt32_#t~bitwise192#1 % 4294967296;havoc getopt32_#t~mem191#1;havoc getopt32_#t~bitwise192#1; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: assume !(0 != getopt32_#t~bitwise192#1 % 4294967296);havoc getopt32_#t~mem191#1;havoc getopt32_#t~bitwise192#1;call getopt32_#t~mem193#1 := read~int#20(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem194#1 := read~int#20(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-2: havoc getopt32_#t~bitwise192#1;assume getopt32_#t~bitwise192#1 % 4294967296 <= getopt32_#t~mem191#1 % 4294967296 && getopt32_#t~bitwise192#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-4: assume 0 == getopt32_#t~mem191#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise192#1 := 0; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-4: assume !(0 == getopt32_#t~mem191#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-3: assume getopt32_#t~mem191#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise192#1 := getopt32_#t~mem191#1; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-3: assume !(getopt32_#t~mem191#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-5: call getopt32_#t~mem191#1 := read~int#20(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: assume -1 == __main_~c~0#1; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: assume !(-1 == __main_~c~0#1); [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: getopt32_~trigger~0#1 := getopt32_#t~bitwise195#1;havoc getopt32_#t~mem193#1;havoc getopt32_#t~mem194#1;havoc getopt32_#t~bitwise195#1;call getopt32_#t~mem196#1 := read~int#20(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-2: havoc getopt32_#t~bitwise195#1;assume getopt32_#t~bitwise195#1 % 4294967296 <= getopt32_#t~mem193#1 % 4294967296 && getopt32_#t~bitwise195#1 % 4294967296 <= getopt32_#t~mem194#1 % 4294967296; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-1: [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-4: assume 0 == getopt32_#t~mem193#1 % 4294967296 || 0 == getopt32_#t~mem194#1 % 4294967296;getopt32_#t~bitwise195#1 := 0; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-4: assume !(0 == getopt32_#t~mem193#1 % 4294967296 || 0 == getopt32_#t~mem194#1 % 4294967296); [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-3: assume getopt32_#t~mem193#1 % 4294967296 == getopt32_#t~mem194#1 % 4294967296;getopt32_#t~bitwise195#1 := getopt32_#t~mem193#1; [2025-02-08 13:26:21,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-3: assume !(getopt32_#t~mem193#1 % 4294967296 == getopt32_#t~mem194#1 % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-1: [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: assume !(0 == __main_#t~bitwise97#1 % 4294967296);havoc __main_#t~bitwise97#1;havoc __main_~fold_main$$1$$2$$2$$4$$i~0#1;__main_~logical_end~0#1 := __main_~offset_out~0#1 - 1; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: assume !!(0 == __main_#t~bitwise97#1 % 4294967296);havoc __main_#t~bitwise97#1; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-3: assume 2 == ~option_mask32~0 % 4294967296;__main_#t~bitwise97#1 := 2; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-3: assume !(2 == ~option_mask32~0 % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-2: havoc __main_#t~bitwise97#1;assume __main_#t~bitwise97#1 % 4294967296 <= 2 && __main_#t~bitwise97#1 % 4294967296 <= ~option_mask32~0 % 4294967296; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-4: assume 0 == ~option_mask32~0 % 4294967296;__main_#t~bitwise97#1 := 0; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-4: assume !(0 == ~option_mask32~0 % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: getopt32_~flags~0#1 := getopt32_#t~bitwise198#1;havoc getopt32_#t~mem196#1;havoc getopt32_#t~bitwise197#1;havoc getopt32_#t~bitwise198#1;call getopt32_#t~mem199#1 := read~int#20(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296;getopt32_#t~bitwise198#1 := getopt32_~flags~0#1; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-2: havoc getopt32_#t~bitwise198#1;assume getopt32_#t~bitwise198#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise198#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise197#1) % 4294967296; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-5: [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296;getopt32_#t~bitwise198#1 := 0; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-7: assume getopt32_#t~mem196#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise197#1 := 0; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-7: assume !(getopt32_#t~mem196#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-6: havoc getopt32_#t~bitwise197#1;assume getopt32_#t~bitwise197#1 % 4294967296 <= getopt32_#t~mem196#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-9: assume 0 == getopt32_#t~mem196#1 % 4294967296;getopt32_#t~bitwise197#1 := getopt32_~trigger~0#1; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-9: assume !(0 == getopt32_#t~mem196#1 % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise197#1 := getopt32_#t~mem196#1; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2495: assume 0 == __main_~offset_out~0#1 % 4096 % 4294967296;havoc __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset;assume { :begin_inline_xrealloc } true;xrealloc_#in~ptr#1.base, xrealloc_#in~ptr#1.offset, xrealloc_#in~size#1 := __main_~line_out~0#1.base, __main_~line_out~0#1.offset, (4096 + __main_~offset_out~0#1) % 4294967296;havoc xrealloc_#res#1.base, xrealloc_#res#1.offset;havoc xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset, xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset, xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset, xrealloc_~size#1;xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset := xrealloc_#in~ptr#1.base, xrealloc_#in~ptr#1.offset;xrealloc_~size#1 := xrealloc_#in~size#1; [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2495: assume !(0 == __main_~offset_out~0#1 % 4096 % 4294967296); [2025-02-08 13:26:21,616 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958: getopt32_~flags~0#1 := getopt32_#t~bitwise201#1;havoc getopt32_#t~mem199#1;havoc getopt32_#t~bitwise200#1;havoc getopt32_#t~bitwise201#1; [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-2: havoc getopt32_#t~bitwise201#1;assume (getopt32_#t~bitwise201#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise201#1 % 4294967296 >= getopt32_#t~bitwise200#1 % 4294967296) && getopt32_#t~bitwise201#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise200#1 % 4294967296; [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-1: [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise200#1 % 4294967296;getopt32_#t~bitwise201#1 := getopt32_#t~bitwise200#1; [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise200#1 % 4294967296); [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-3: assume 0 == getopt32_#t~bitwise200#1 % 4294967296;getopt32_#t~bitwise201#1 := getopt32_~flags~0#1; [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-3: assume !(0 == getopt32_#t~bitwise200#1 % 4294967296); [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-6: havoc getopt32_#t~bitwise200#1;assume getopt32_#t~bitwise200#1 % 4294967296 <= getopt32_#t~mem199#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-5: [2025-02-08 13:26:21,617 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise200#1 := getopt32_#t~mem199#1; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-7: assume getopt32_#t~mem199#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise200#1 := 0; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-7: assume !(getopt32_#t~mem199#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-9: assume 0 == getopt32_#t~mem199#1 % 4294967296;getopt32_#t~bitwise200#1 := getopt32_~trigger~0#1; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-9: assume !(0 == getopt32_#t~mem199#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-1: [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: getopt32_~flags~0#1 := getopt32_#t~bitwise202#1;havoc getopt32_#t~bitwise202#1;call getopt32_#t~mem203#1.base, getopt32_#t~mem203#1.offset := read~$Pointer$#20(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise202#1 := 0; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-2: havoc getopt32_#t~bitwise202#1;assume getopt32_#t~bitwise202#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise202#1 := getopt32_~trigger~0#1; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise202#1 := getopt32_~flags~0#1; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !(0 == __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !!(0 == __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume !(getopt32_#t~mem203#1.base == 0 && getopt32_#t~mem203#1.offset == 0);havoc getopt32_#t~mem203#1.base, getopt32_#t~mem203#1.offset;call getopt32_#t~mem204#1.base, getopt32_#t~mem204#1.offset := read~$Pointer$#20(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem205#1.base, getopt32_#t~mem205#1.offset := read~$Pointer$#20(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem206#1 := read~int#16(getopt32_#t~mem205#1.base, getopt32_#t~mem205#1.offset, 4); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume !!(getopt32_#t~mem203#1.base == 0 && getopt32_#t~mem203#1.offset == 0);havoc getopt32_#t~mem203#1.base, getopt32_#t~mem203#1.offset; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2564: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, __main_~offset_out~0#1); srcloc: null [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2498: __main_#t~ret95#1.base, __main_#t~ret95#1.offset := xrealloc_#res#1.base, xrealloc_#res#1.offset;havoc xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset, xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset, xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset, xrealloc_~size#1;havoc xrealloc_#in~ptr#1.base, xrealloc_#in~ptr#1.offset, xrealloc_#in~size#1;assume { :end_inline_xrealloc } true;__main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset := __main_#t~ret95#1.base, __main_#t~ret95#1.offset;havoc __main_#t~ret95#1.base, __main_#t~ret95#1.offset;__main_~line_out~0#1.base, __main_~line_out~0#1.offset := __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset;havoc __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume (if __main_~logical_end~0#1 % 4294967296 % 4294967296 <= 2147483647 then __main_~logical_end~0#1 % 4294967296 % 4294967296 else __main_~logical_end~0#1 % 4294967296 % 4294967296 - 4294967296) >= 0;havoc __main_~bb__isblank~0#1;call __main_#t~mem98#1 := read~int#22(__main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 else __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);__main_~bb__isblank~0#1 := __main_#t~mem98#1;havoc __main_#t~mem98#1;__main_~tmp_statement_expression$3~0#1 := (if 0 == (if 32 == (if __main_~bb__isblank~0#1 % 256 % 4294967296 <= 2147483647 then __main_~bb__isblank~0#1 % 256 % 4294967296 else __main_~bb__isblank~0#1 % 256 % 4294967296 - 4294967296) || 9 == (if __main_~bb__isblank~0#1 % 256 % 4294967296 <= 2147483647 then __main_~bb__isblank~0#1 % 256 % 4294967296 else __main_~bb__isblank~0#1 % 256 % 4294967296 - 4294967296) then 1 else 0) then 0 else 1); [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume !((if __main_~logical_end~0#1 % 4294967296 % 4294967296 <= 2147483647 then __main_~logical_end~0#1 % 4294967296 % 4294967296 else __main_~logical_end~0#1 % 4294967296 % 4294967296 - 4294967296) >= 0);havoc __main_~fold_main$$1$$2$$2$$4$$i~0#1, __main_~logical_end~0#1; [2025-02-08 13:26:21,618 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961-1: assume 1 + getopt32_#t~mem206#1 >= -2147483648; [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961-1: assume !(1 + getopt32_#t~mem206#1 >= -2147483648); [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume 1 + getopt32_#t~mem206#1 <= 2147483647;call write~int#16(1 + getopt32_#t~mem206#1, getopt32_#t~mem204#1.base, getopt32_#t~mem204#1.offset, 4); [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(1 + getopt32_#t~mem206#1 <= 2147483647); [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2598: fopen_or_warn_stdin_#t~ret110#1.base, fopen_or_warn_stdin_#t~ret110#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet107#1.base, fopen_or_warn_#t~nondet107#1.offset, fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset, fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset, fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;havoc fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset, fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset;assume { :end_inline_fopen_or_warn } true;fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset := fopen_or_warn_stdin_#t~ret110#1.base, fopen_or_warn_stdin_#t~ret110#1.offset; [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: havoc __main_~return_value_fclose_if_not_stdin$5~0#1;assume { :begin_inline_fclose_if_not_stdin } true;fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset := __main_~istream~0#1.base, __main_~istream~0#1.offset;havoc fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet73#1, fclose_if_not_stdin_#t~nondet74#1, fclose_if_not_stdin_#t~bitwise75#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset := fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;havoc fclose_if_not_stdin_~r~0#1;assume -2147483648 <= fclose_if_not_stdin_#t~nondet73#1 && fclose_if_not_stdin_#t~nondet73#1 <= 2147483647;fclose_if_not_stdin_~r~0#1 := fclose_if_not_stdin_#t~nondet73#1;havoc fclose_if_not_stdin_#t~nondet73#1; [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem207#1 := read~int#20(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: __main_#t~ret103#1 := fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet73#1, fclose_if_not_stdin_#t~nondet74#1, fclose_if_not_stdin_#t~bitwise75#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;havoc fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;assume { :end_inline_fclose_if_not_stdin } true;assume -2147483648 <= __main_#t~ret103#1 && __main_#t~ret103#1 <= 2147483647;__main_~return_value_fclose_if_not_stdin$5~0#1 := __main_#t~ret103#1;havoc __main_#t~ret103#1; [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567: assume !(0 == __main_~return_value_fclose_if_not_stdin$5~0#1);call __main_#t~mem104#1.base, __main_#t~mem104#1.offset := read~$Pointer$#9(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567: assume !!(0 == __main_~return_value_fclose_if_not_stdin$5~0#1); [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501-1: assume true; [2025-02-08 13:26:21,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501-1: assume !true; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501: assume true;call write~int#22((if __main_~c~0#1 % 256 <= 127 then __main_~c~0#1 % 256 else __main_~c~0#1 % 256 - 256), __main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 else __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501: assume !true; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964: assume 1 == getopt32_#t~mem207#1;havoc getopt32_#t~mem207#1;call getopt32_#t~mem208#1.base, getopt32_#t~mem208#1.offset := read~$Pointer$#20(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);assume { :begin_inline_llist_add_to_end } true;llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset := getopt32_#t~mem208#1.base, getopt32_#t~mem208#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset, llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset, llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset, llist_add_to_end_#t~mem230#1.base, llist_add_to_end_#t~mem230#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964: assume !(1 == getopt32_#t~mem207#1);havoc getopt32_#t~mem207#1;call getopt32_#t~mem209#1 := read~int#20(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: havoc xasprintf_#t~mem240#1.base, xasprintf_#t~mem240#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;__main_#t~ret86#1.base, __main_#t~ret86#1.offset := xasprintf_#res#1.base, xasprintf_#res#1.offset;havoc xasprintf_#t~ret238#1, xasprintf_#t~varargs239#1.base, xasprintf_#t~varargs239#1.offset, xasprintf_#t~mem240#1.base, xasprintf_#t~mem240#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset, xasprintf_~r~1#1, xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;havoc xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset, xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset;assume { :end_inline_xasprintf } true;call write~$Pointer$#9(__main_#t~ret86#1.base, __main_#t~ret86#1.offset, __main_~argv#1.base, __main_~argv#1.offset + 8 * __main_~i~0#1, 8);havoc __main_#t~varargs85#1.base, __main_#t~varargs85#1.offset;havoc __main_#t~ret86#1.base, __main_#t~ret86#1.offset; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569-1: SUMMARY for call bb_simple_perror_msg(__main_#t~mem104#1.base, __main_#t~mem104#1.offset); srcloc: null [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: assume !(0 == __main_~tmp_statement_expression$3~0#1 % 256);__main_~logical_end~0#1 := 1 + __main_~logical_end~0#1; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: assume !!(0 == __main_~tmp_statement_expression$3~0#1 % 256);havoc __main_~bb__isblank~0#1;__main_~logical_end~0#1 := __main_~logical_end~0#1 - 1; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569: havoc __main_#t~mem104#1.base, __main_#t~mem104#1.offset;__main_~exitcode~0#1 := 1; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: assume !(0 == fclose_if_not_stdin_~r~0#1);call write~int#7(5, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: assume !!(0 == fclose_if_not_stdin_~r~0#1); [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume 2 == getopt32_#t~mem209#1;havoc getopt32_#t~mem209#1;havoc getopt32_~return_value_xatoi_positive$13~0#1;assume { :begin_inline_xatoi_positive } true;xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset := ~optarg~0.base, ~optarg~0.offset;havoc xatoi_positive_#res#1;havoc xatoi_positive_#t~ret241#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset := xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;havoc xatoi_positive_~return_value_xatou_range$1~0#1; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume !(2 == getopt32_#t~mem209#1);havoc getopt32_#t~mem209#1;call getopt32_#t~mem212#1.base, getopt32_#t~mem212#1.offset := read~$Pointer$#20(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-1: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, __main_~logical_end~0#1); srcloc: null [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2506: assume 10 == __main_~c~0#1; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2506: assume !(10 == __main_~c~0#1); [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: assume -2147483648 <= __main_#t~nondet99#1 && __main_#t~nondet99#1 <= 2147483647;havoc __main_#t~nondet99#1; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: call ULTIMATE.dealloc(__main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset);havoc __main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2407: havoc fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134: xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset := xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset;havoc xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset; [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134-1: SUMMARY for call xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset := #Ultimate.C_realloc#22(xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset, xrealloc_~size#1); srcloc: null [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~istream~0#1.base, __main_~istream~0#1.offset, __main_~c~0#1, __main_~column~0#1, __main_~offset_out~0#1;call __main_#t~mem105#1.base, __main_#t~mem105#1.offset := read~$Pointer$#9(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:21,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: assume !(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset);assume -2147483648 <= fclose_if_not_stdin_#t~nondet74#1 && fclose_if_not_stdin_#t~nondet74#1 <= 2147483647;fclose_if_not_stdin_~return_value_fclose$1~0#1 := fclose_if_not_stdin_#t~nondet74#1;havoc fclose_if_not_stdin_#t~nondet74#1; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: assume !!(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset); [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102: xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret241#1;havoc xatoi_positive_#t~ret241#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3135: assume xrealloc_~ptr#1.base == 0 && xrealloc_~ptr#1.offset == 0; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3135: assume !(xrealloc_~ptr#1.base == 0 && xrealloc_~ptr#1.offset == 0); [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: assume true;call llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset := read~$Pointer$#16(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: assume !true; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102-1: SUMMARY for call xatoi_positive_#t~ret241#1 := xatou_range(xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647); srcloc: null [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036-2: assume !!(llist_add_to_end_#t~mem227#1.base == 0 && llist_add_to_end_#t~mem227#1.offset == 0);havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036-2: assume !(llist_add_to_end_#t~mem227#1.base == 0 && llist_add_to_end_#t~mem227#1.offset == 0);havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset;call llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset := read~$Pointer$#16(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset;havoc llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: getopt32_#t~ret210#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret241#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;havoc xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;assume { :end_inline_xatoi_positive } true;assume -2147483648 <= getopt32_#t~ret210#1 && getopt32_#t~ret210#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret210#1;havoc getopt32_#t~ret210#1;call getopt32_#t~mem211#1.base, getopt32_#t~mem211#1.offset := read~$Pointer$#20(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int#16(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem211#1.base, getopt32_#t~mem211#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem211#1.base, getopt32_#t~mem211#1.offset; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541-1: SUMMARY for call __main_#t~memmove~res100#1.base, __main_#t~memmove~res100#1.offset := #Ultimate.C_memmove#22(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, __main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 else __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), (__main_~offset_out~0#1 - __main_~logical_end~0#1) % 4294967296); srcloc: null [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508: __main_~offset_out~0#1 := 0;__main_~column~0#1 := __main_~offset_out~0#1; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541: havoc __main_#t~memmove~res100#1.base, __main_#t~memmove~res100#1.offset;__main_~offset_out~0#1 := __main_~offset_out~0#1 - __main_~logical_end~0#1;__main_~fold_main$$1$$2$$2$$4$$i~0#1 := 0;__main_~column~0#1 := __main_~fold_main$$1$$2$$2$$4$$i~0#1; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508-1: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, 1 + __main_~offset_out~0#1); srcloc: null [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: havoc getopt_long_#t~ret295#1;getopt32_#t~ret188#1 := getopt_long_#res#1;havoc getopt_long_#t~mem291#1.base, getopt_long_#t~mem291#1.offset, getopt_long_#t~mem292#1, getopt_long_#t~mem293#1.base, getopt_long_#t~mem293#1.offset, getopt_long_#t~mem294#1, getopt_long_#t~ret295#1, getopt_long_~argc#1, getopt_long_~#argv#1.base, getopt_long_~#argv#1.offset, getopt_long_~optstring#1.base, getopt_long_~optstring#1.offset, getopt_long_~longopts#1.base, getopt_long_~longopts#1.offset, getopt_long_~longindex#1.base, getopt_long_~longindex#1.offset;havoc getopt_long_#in~argc#1, getopt_long_#in~argv#1.base, getopt_long_#in~argv#1.offset, getopt_long_#in~optstring#1.base, getopt_long_#in~optstring#1.offset, getopt_long_#in~longopts#1.base, getopt_long_#in~longopts#1.offset, getopt_long_#in~longindex#1.base, getopt_long_#in~longindex#1.offset;assume { :end_inline_getopt_long } true;assume -2147483648 <= getopt32_#t~ret188#1 && getopt32_#t~ret188#1 <= 2147483647;getopt32_~c~1#1 := getopt32_#t~ret188#1;havoc getopt32_#t~ret188#1; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268-2: getopt_long_#t~ret295#1 := getopt_#res#1;havoc getopt_#t~mem275#1.base, getopt_#t~mem275#1.offset, getopt_#t~mem276#1, getopt_#t~short277#1, getopt_#t~nondet278#1, getopt_#t~nondet279#1, getopt_#t~mem280#1, getopt_#t~short281#1, getopt_#t~nondet282#1, getopt_#t~mem283#1, getopt_#t~nondet284#1, getopt_#t~pre285#1, getopt_#t~mem286#1, getopt_#t~short287#1, getopt_#t~nondet288#1, getopt_#t~mem289#1.base, getopt_#t~mem289#1.offset, getopt_#t~pre290#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~0#1, getopt_~opt_index~0#1;havoc getopt_#in~argc#1, getopt_#in~argv#1.base, getopt_#in~argv#1.offset, getopt_#in~optstring#1.base, getopt_#in~optstring#1.offset;assume { :end_inline_getopt } true;assume -2147483648 <= getopt_long_#t~ret295#1 && getopt_long_#t~ret295#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret295#1;havoc getopt_long_#t~ret295#1; [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3137: assume !(0 == xrealloc_~size#1 % 18446744073709551616);call xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3137: assume !!(0 == xrealloc_~size#1 % 18446744073709551616); [2025-02-08 13:26:21,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3038: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 16;havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset, xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411: havoc fclose_if_not_stdin_#t~bitwise75#1; [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-3: [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-2: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_#t~bitwise75#1;havoc fclose_if_not_stdin_#t~bitwise75#1; [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-5: assume 0 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise75#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-5: assume !(0 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-4: havoc fclose_if_not_stdin_#t~bitwise75#1;assume (((((fclose_if_not_stdin_~r~0#1 < 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise75#1 >= fclose_if_not_stdin_~return_value_fclose$1~0#1) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise75#1 >= fclose_if_not_stdin_~r~0#1)) && ((fclose_if_not_stdin_~r~0#1 < 0 || fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise75#1 <= fclose_if_not_stdin_~r~0#1 + fclose_if_not_stdin_~return_value_fclose$1~0#1)) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise75#1 < 0)) && fclose_if_not_stdin_#t~bitwise75#1 <= 2147483647; [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-6: assume 0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise75#1 := fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-6: assume !(0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3138: SUMMARY for call bb_error_msg_and_die(~#bb_msg_memory_exhausted~0.base, ~#bb_msg_memory_exhausted~0.offset, xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset); srcloc: null [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset, xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset;havoc llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset;call write~$Pointer$#16(llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call llist_add_to_end_#t~mem230#1.base, llist_add_to_end_#t~mem230#1.offset := read~$Pointer$#16(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#16(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem230#1.base, 8 + llist_add_to_end_#t~mem230#1.offset, 8);havoc llist_add_to_end_#t~mem230#1.base, llist_add_to_end_#t~mem230#1.offset;havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset, llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset, llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset, llist_add_to_end_#t~mem230#1.base, llist_add_to_end_#t~mem230#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;havoc llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset;assume { :end_inline_llist_add_to_end } true; [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !(getopt32_#t~mem212#1.base == 0 && getopt32_#t~mem212#1.offset == 0);havoc getopt32_#t~mem212#1.base, getopt32_#t~mem212#1.offset;call getopt32_#t~mem213#1.base, getopt32_#t~mem213#1.offset := read~$Pointer$#20(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$#16(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem213#1.base, getopt32_#t~mem213#1.offset, 8); [2025-02-08 13:26:21,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !!(getopt32_#t~mem212#1.base == 0 && getopt32_#t~mem212#1.offset == 0);havoc getopt32_#t~mem212#1.base, getopt32_#t~mem212#1.offset; [2025-02-08 13:26:21,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: assume !(__main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 >= __main_~offset_out~0#1 % 4294967296);havoc __main_~return_value_adjust_column$4~0#1;call __main_#t~mem101#1 := read~int#22(__main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 % 18446744073709551616 else __main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:26:21,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: assume !!(__main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 >= __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:21,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: assume !(__main_#t~mem105#1.base == 0 && __main_#t~mem105#1.offset == 0);havoc __main_#t~mem105#1.base, __main_#t~mem105#1.offset; [2025-02-08 13:26:21,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: assume !!(__main_#t~mem105#1.base == 0 && __main_#t~mem105#1.offset == 0);havoc __main_#t~mem105#1.base, __main_#t~mem105#1.offset; [2025-02-08 13:26:21,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2413-1: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:26:21,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3140-1: xrealloc_#res#1.base, xrealloc_#res#1.offset := xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset; [2025-02-08 13:26:21,827 INFO L? ?]: Removed 1034 outVars from TransFormulas that were not future-live. [2025-02-08 13:26:21,827 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:26:21,862 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:26:21,865 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:26:21,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:21 BoogieIcfgContainer [2025-02-08 13:26:21,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:26:21,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:26:21,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:26:21,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:26:21,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:26:13" (1/3) ... [2025-02-08 13:26:21,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d665bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:21, skipping insertion in model container [2025-02-08 13:26:21,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14" (2/3) ... [2025-02-08 13:26:21,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d665bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:21, skipping insertion in model container [2025-02-08 13:26:21,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:21" (3/3) ... [2025-02-08 13:26:21,873 INFO L128 eAbstractionObserver]: Analyzing ICFG fold-2.i [2025-02-08 13:26:21,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:26:21,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fold-2.i that has 102 procedures, 868 locations, 1 initial locations, 126 loop locations, and 74 error locations. [2025-02-08 13:26:21,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:26:21,933 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;@4090e6fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:26:21,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-02-08 13:26:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 477 states, 353 states have (on average 1.6827195467422096) internal successors, (594), 447 states have internal predecessors, (594), 21 states have call successors, (21), 12 states have call predecessors, (21), 12 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 13:26:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:26:21,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:21,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:26:21,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:21,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1519258, now seen corresponding path program 1 times [2025-02-08 13:26:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:21,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026661596] [2025-02-08 13:26:21,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:26:22,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:26:22,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:22,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:22,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026661596] [2025-02-08 13:26:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026661596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:22,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:26:22,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523758622] [2025-02-08 13:26:22,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:22,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:22,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:22,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:22,922 INFO L87 Difference]: Start difference. First operand has 477 states, 353 states have (on average 1.6827195467422096) internal successors, (594), 447 states have internal predecessors, (594), 21 states have call successors, (21), 12 states have call predecessors, (21), 12 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:23,013 INFO L93 Difference]: Finished difference Result 729 states and 990 transitions. [2025-02-08 13:26:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:26:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:23,023 INFO L225 Difference]: With dead ends: 729 [2025-02-08 13:26:23,027 INFO L226 Difference]: Without dead ends: 235 [2025-02-08 13:26:23,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:23,038 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:23,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-08 13:26:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-02-08 13:26:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 185 states have (on average 1.518918918918919) internal successors, (281), 220 states have internal predecessors, (281), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 297 transitions. [2025-02-08 13:26:23,115 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 297 transitions. Word has length 3 [2025-02-08 13:26:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 297 transitions. [2025-02-08 13:26:23,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 297 transitions. [2025-02-08 13:26:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:26:23,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:23,115 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:26:23,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:26:23,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1982970307, now seen corresponding path program 1 times [2025-02-08 13:26:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389881117] [2025-02-08 13:26:23,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:23,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:23,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:23,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:23,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389881117] [2025-02-08 13:26:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389881117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750071652] [2025-02-08 13:26:23,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:23,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:23,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:26:24,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:24,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:24,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:24,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:24,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:24,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:24,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750071652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:24,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:26:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815099516] [2025-02-08 13:26:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:24,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:24,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:24,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:24,546 INFO L87 Difference]: Start difference. First operand 235 states and 297 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:28,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:28,645 INFO L93 Difference]: Finished difference Result 235 states and 297 transitions. [2025-02-08 13:26:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:26:28,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:26:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:28,647 INFO L225 Difference]: With dead ends: 235 [2025-02-08 13:26:28,647 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 13:26:28,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:28,648 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:28,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 850 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 13:26:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-08 13:26:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 185 states have (on average 1.5135135135135136) internal successors, (280), 219 states have internal predecessors, (280), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 296 transitions. [2025-02-08 13:26:28,664 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 296 transitions. Word has length 6 [2025-02-08 13:26:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:28,664 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 296 transitions. [2025-02-08 13:26:28,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 296 transitions. [2025-02-08 13:26:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:26:28,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:28,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:26:28,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:26:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:28,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:28,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1342535908, now seen corresponding path program 1 times [2025-02-08 13:26:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709982084] [2025-02-08 13:26:28,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:29,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:26:29,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:26:29,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:29,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:26:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:29,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709982084] [2025-02-08 13:26:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709982084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106876818] [2025-02-08 13:26:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:29,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:29,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:29,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:29,327 INFO L87 Difference]: Start difference. First operand 234 states and 296 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:29,376 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2025-02-08 13:26:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:29,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:26:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:29,377 INFO L225 Difference]: With dead ends: 234 [2025-02-08 13:26:29,378 INFO L226 Difference]: Without dead ends: 233 [2025-02-08 13:26:29,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:29,378 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:29,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-08 13:26:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-02-08 13:26:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 183 states have (on average 1.5136612021857923) internal successors, (277), 216 states have internal predecessors, (277), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 293 transitions. [2025-02-08 13:26:29,385 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 293 transitions. Word has length 7 [2025-02-08 13:26:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:29,385 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 293 transitions. [2025-02-08 13:26:29,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 293 transitions. [2025-02-08 13:26:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:26:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:29,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:26:29,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:29,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1962929427, now seen corresponding path program 1 times [2025-02-08 13:26:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061045536] [2025-02-08 13:26:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:29,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:29,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:29,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:29,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061045536] [2025-02-08 13:26:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061045536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200128431] [2025-02-08 13:26:29,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:29,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:29,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:29,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:29,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:26:30,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:30,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:30,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:30,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:30,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:26:30,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200128431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:30,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381342713] [2025-02-08 13:26:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:30,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:30,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:30,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:30,824 INFO L87 Difference]: Start difference. First operand 231 states and 293 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:34,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:34,900 INFO L93 Difference]: Finished difference Result 231 states and 293 transitions. [2025-02-08 13:26:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:34,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:26:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:34,901 INFO L225 Difference]: With dead ends: 231 [2025-02-08 13:26:34,901 INFO L226 Difference]: Without dead ends: 229 [2025-02-08 13:26:34,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:34,902 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 237 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:34,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 321 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-08 13:26:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-08 13:26:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 183 states have (on average 1.5027322404371584) internal successors, (275), 214 states have internal predecessors, (275), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 291 transitions. [2025-02-08 13:26:34,918 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 291 transitions. Word has length 11 [2025-02-08 13:26:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:34,919 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 291 transitions. [2025-02-08 13:26:34,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 291 transitions. [2025-02-08 13:26:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:26:34,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:34,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:34,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:26:35,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:35,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash -721268634, now seen corresponding path program 1 times [2025-02-08 13:26:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329429099] [2025-02-08 13:26:35,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:35,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:35,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:35,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:35,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329429099] [2025-02-08 13:26:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329429099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124591102] [2025-02-08 13:26:35,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:35,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:35,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:35,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:35,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:26:36,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:36,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:36,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:36,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:36,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:36,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:36,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124591102] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:36,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:36,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:26:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779589195] [2025-02-08 13:26:36,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:36,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:36,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:36,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:36,784 INFO L87 Difference]: Start difference. First operand 229 states and 291 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:36,845 INFO L93 Difference]: Finished difference Result 462 states and 588 transitions. [2025-02-08 13:26:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:26:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:36,847 INFO L225 Difference]: With dead ends: 462 [2025-02-08 13:26:36,847 INFO L226 Difference]: Without dead ends: 238 [2025-02-08 13:26:36,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:36,848 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 4 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:36,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 845 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-08 13:26:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-08 13:26:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 192 states have (on average 1.4791666666666667) internal successors, (284), 223 states have internal predecessors, (284), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2025-02-08 13:26:36,860 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 12 [2025-02-08 13:26:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:36,860 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2025-02-08 13:26:36,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2025-02-08 13:26:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:26:36,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:36,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:36,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:37,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:37,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:37,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1804216643, now seen corresponding path program 2 times [2025-02-08 13:26:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531358558] [2025-02-08 13:26:37,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:37,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:26:37,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:26:37,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:37,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:37,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531358558] [2025-02-08 13:26:37,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531358558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:37,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:37,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:26:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774436973] [2025-02-08 13:26:37,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:37,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:26:37,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:37,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:26:37,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:37,558 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:41,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:41,667 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2025-02-08 13:26:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:26:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:26:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:41,669 INFO L225 Difference]: With dead ends: 238 [2025-02-08 13:26:41,669 INFO L226 Difference]: Without dead ends: 236 [2025-02-08 13:26:41,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:41,669 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 236 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:41,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 860 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-08 13:26:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-02-08 13:26:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 192 states have (on average 1.46875) internal successors, (282), 221 states have internal predecessors, (282), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 298 transitions. [2025-02-08 13:26:41,675 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 298 transitions. Word has length 21 [2025-02-08 13:26:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:41,676 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 298 transitions. [2025-02-08 13:26:41,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 298 transitions. [2025-02-08 13:26:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:26:41,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:41,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:41,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:26:41,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -157590293, now seen corresponding path program 1 times [2025-02-08 13:26:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546760293] [2025-02-08 13:26:41,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:42,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:26:42,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:26:42,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:42,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:42,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546760293] [2025-02-08 13:26:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546760293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:26:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262669236] [2025-02-08 13:26:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:42,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:42,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:42,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:42,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:42,180 INFO L87 Difference]: Start difference. First operand 236 states and 298 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:46,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:46,270 INFO L93 Difference]: Finished difference Result 456 states and 581 transitions. [2025-02-08 13:26:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:46,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:26:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:46,272 INFO L225 Difference]: With dead ends: 456 [2025-02-08 13:26:46,272 INFO L226 Difference]: Without dead ends: 239 [2025-02-08 13:26:46,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:46,273 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:46,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 557 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-08 13:26:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-02-08 13:26:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 224 states have internal predecessors, (285), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 301 transitions. [2025-02-08 13:26:46,283 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 301 transitions. Word has length 26 [2025-02-08 13:26:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:46,284 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 301 transitions. [2025-02-08 13:26:46,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 301 transitions. [2025-02-08 13:26:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:46,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:46,285 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:46,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:26:46,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:46,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash -366958852, now seen corresponding path program 1 times [2025-02-08 13:26:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659539440] [2025-02-08 13:26:46,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:46,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:46,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:46,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:46,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659539440] [2025-02-08 13:26:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659539440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307974137] [2025-02-08 13:26:46,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:46,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:46,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:46,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:46,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:26:47,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:47,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:47,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:47,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:47,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:47,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:26:47,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307974137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:47,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:47,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:47,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047527850] [2025-02-08 13:26:47,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:47,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:47,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:47,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:47,597 INFO L87 Difference]: Start difference. First operand 239 states and 301 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:51,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:51,683 INFO L93 Difference]: Finished difference Result 239 states and 301 transitions. [2025-02-08 13:26:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:51,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:26:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:51,685 INFO L225 Difference]: With dead ends: 239 [2025-02-08 13:26:51,685 INFO L226 Difference]: Without dead ends: 238 [2025-02-08 13:26:51,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:51,685 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 3 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:51,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 547 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-08 13:26:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-08 13:26:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.4564102564102563) internal successors, (284), 223 states have internal predecessors, (284), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2025-02-08 13:26:51,691 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 29 [2025-02-08 13:26:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2025-02-08 13:26:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2025-02-08 13:26:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:51,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:51,692 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:51,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:26:51,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:26:51,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -366958692, now seen corresponding path program 1 times [2025-02-08 13:26:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641946883] [2025-02-08 13:26:51,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:52,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:52,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:52,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:52,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:52,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:52,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641946883] [2025-02-08 13:26:52,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641946883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:52,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437933112] [2025-02-08 13:26:52,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:52,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:52,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:52,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:52,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:26:53,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:53,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:53,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:53,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:53,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:26:53,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:26:53,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:26:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437933112] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:53,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:26:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934089636] [2025-02-08 13:26:53,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:26:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:26:53,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:26:53,472 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:26:57,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:01,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:01,707 INFO L93 Difference]: Finished difference Result 479 states and 609 transitions. [2025-02-08 13:27:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:27:01,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:27:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:01,710 INFO L225 Difference]: With dead ends: 479 [2025-02-08 13:27:01,711 INFO L226 Difference]: Without dead ends: 255 [2025-02-08 13:27:01,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:27:01,712 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 5 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:01,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1362 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-08 13:27:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-08 13:27:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-02-08 13:27:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 213 states have (on average 1.4131455399061033) internal successors, (301), 240 states have internal predecessors, (301), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 317 transitions. [2025-02-08 13:27:01,722 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 317 transitions. Word has length 29 [2025-02-08 13:27:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:01,722 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 317 transitions. [2025-02-08 13:27:01,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:27:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 317 transitions. [2025-02-08 13:27:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:27:01,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:01,724 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:01,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:27:01,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:01,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:01,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash 454098632, now seen corresponding path program 1 times [2025-02-08 13:27:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078111936] [2025-02-08 13:27:01,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:02,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:27:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:27:02,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:27:02,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078111936] [2025-02-08 13:27:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078111936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:02,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:02,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484698018] [2025-02-08 13:27:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:02,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:02,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:02,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:02,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:02,346 INFO L87 Difference]: Start difference. First operand 255 states and 317 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:06,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:06,441 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2025-02-08 13:27:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:27:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:06,442 INFO L225 Difference]: With dead ends: 266 [2025-02-08 13:27:06,442 INFO L226 Difference]: Without dead ends: 265 [2025-02-08 13:27:06,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:06,443 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:06,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 551 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:27:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-08 13:27:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2025-02-08 13:27:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 222 states have (on average 1.40990990990991) internal successors, (313), 249 states have internal predecessors, (313), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 329 transitions. [2025-02-08 13:27:06,453 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 329 transitions. Word has length 48 [2025-02-08 13:27:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:06,453 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 329 transitions. [2025-02-08 13:27:06,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 329 transitions. [2025-02-08 13:27:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:27:06,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:06,455 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:06,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:27:06,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 454103597, now seen corresponding path program 1 times [2025-02-08 13:27:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527298960] [2025-02-08 13:27:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:06,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:27:06,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:27:06,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:06,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:27:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:06,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527298960] [2025-02-08 13:27:06,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527298960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:06,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:06,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683942435] [2025-02-08 13:27:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:06,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:06,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:06,811 INFO L87 Difference]: Start difference. First operand 264 states and 329 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:10,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:10,885 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2025-02-08 13:27:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:10,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:27:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:10,887 INFO L225 Difference]: With dead ends: 264 [2025-02-08 13:27:10,887 INFO L226 Difference]: Without dead ends: 263 [2025-02-08 13:27:10,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:10,888 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:10,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 553 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:27:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-08 13:27:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2025-02-08 13:27:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 1.408256880733945) internal successors, (307), 244 states have internal predecessors, (307), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 323 transitions. [2025-02-08 13:27:10,901 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 323 transitions. Word has length 48 [2025-02-08 13:27:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:10,901 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 323 transitions. [2025-02-08 13:27:10,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 323 transitions. [2025-02-08 13:27:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:27:10,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:10,904 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:10,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:27:10,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:10,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1110522471, now seen corresponding path program 1 times [2025-02-08 13:27:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:10,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636752826] [2025-02-08 13:27:10,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:11,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:27:11,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:27:11,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:11,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636752826] [2025-02-08 13:27:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636752826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:11,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:11,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:11,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633858750] [2025-02-08 13:27:11,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:11,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:11,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:11,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:11,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:11,289 INFO L87 Difference]: Start difference. First operand 259 states and 323 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:11,336 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2025-02-08 13:27:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 13:27:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:11,338 INFO L225 Difference]: With dead ends: 273 [2025-02-08 13:27:11,339 INFO L226 Difference]: Without dead ends: 271 [2025-02-08 13:27:11,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:11,340 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 11 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:11,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 549 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:27:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-08 13:27:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2025-02-08 13:27:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 229 states have (on average 1.4061135371179039) internal successors, (322), 255 states have internal predecessors, (322), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 338 transitions. [2025-02-08 13:27:11,348 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 338 transitions. Word has length 49 [2025-02-08 13:27:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:11,348 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 338 transitions. [2025-02-08 13:27:11,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 338 transitions. [2025-02-08 13:27:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 13:27:11,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:11,349 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:11,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:27:11,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1720097302, now seen corresponding path program 1 times [2025-02-08 13:27:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619256470] [2025-02-08 13:27:11,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:11,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 13:27:11,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 13:27:11,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:11,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:11,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:11,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619256470] [2025-02-08 13:27:11,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619256470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:11,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:11,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155265228] [2025-02-08 13:27:11,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:11,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:11,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:11,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:11,761 INFO L87 Difference]: Start difference. First operand 270 states and 338 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:11,798 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2025-02-08 13:27:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-08 13:27:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:11,802 INFO L225 Difference]: With dead ends: 387 [2025-02-08 13:27:11,803 INFO L226 Difference]: Without dead ends: 385 [2025-02-08 13:27:11,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:11,803 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 140 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:11,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 551 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:27:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-08 13:27:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 274. [2025-02-08 13:27:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 233 states have (on average 1.4034334763948497) internal successors, (327), 259 states have internal predecessors, (327), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 343 transitions. [2025-02-08 13:27:11,812 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 343 transitions. Word has length 53 [2025-02-08 13:27:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:11,813 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 343 transitions. [2025-02-08 13:27:11,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 343 transitions. [2025-02-08 13:27:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:27:11,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:11,816 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:27:11,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:11,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1806108131, now seen corresponding path program 1 times [2025-02-08 13:27:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062421816] [2025-02-08 13:27:11,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:12,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:27:12,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:27:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:12,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:12,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062421816] [2025-02-08 13:27:12,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062421816] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:12,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21163573] [2025-02-08 13:27:12,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:12,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:12,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:12,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:12,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:27:13,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:27:13,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:27:13,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:13,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:13,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:13,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:13,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:27:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21163573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:13,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:27:13,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:27:13,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437259419] [2025-02-08 13:27:13,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:13,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:27:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:13,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:27:13,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:13,294 INFO L87 Difference]: Start difference. First operand 274 states and 343 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:13,357 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2025-02-08 13:27:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:27:13,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:27:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:13,359 INFO L225 Difference]: With dead ends: 275 [2025-02-08 13:27:13,359 INFO L226 Difference]: Without dead ends: 274 [2025-02-08 13:27:13,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:13,360 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 21 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:13,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 820 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-08 13:27:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2025-02-08 13:27:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.3991416309012876) internal successors, (326), 258 states have internal predecessors, (326), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2025-02-08 13:27:13,377 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 54 [2025-02-08 13:27:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2025-02-08 13:27:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2025-02-08 13:27:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:27:13,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:13,377 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:13,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:27:13,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 13:27:13,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash 154778590, now seen corresponding path program 1 times [2025-02-08 13:27:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:13,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840740487] [2025-02-08 13:27:13,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:13,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:13,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:13,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:13,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:13,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:13,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840740487] [2025-02-08 13:27:13,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840740487] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:13,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156594262] [2025-02-08 13:27:13,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:13,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:13,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:13,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:27:14,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:14,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:14,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:14,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:14,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:14,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:15,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:15,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156594262] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:15,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:15,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:27:15,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72223863] [2025-02-08 13:27:15,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:15,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:27:15,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:15,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:27:15,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:15,046 INFO L87 Difference]: Start difference. First operand 273 states and 342 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:15,120 INFO L93 Difference]: Finished difference Result 311 states and 394 transitions. [2025-02-08 13:27:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:27:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:27:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:15,121 INFO L225 Difference]: With dead ends: 311 [2025-02-08 13:27:15,121 INFO L226 Difference]: Without dead ends: 310 [2025-02-08 13:27:15,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:15,122 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 70 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:15,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 842 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-08 13:27:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2025-02-08 13:27:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 266 states have (on average 1.394736842105263) internal successors, (371), 291 states have internal predecessors, (371), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 387 transitions. [2025-02-08 13:27:15,131 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 387 transitions. Word has length 55 [2025-02-08 13:27:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:15,131 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 387 transitions. [2025-02-08 13:27:15,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 387 transitions. [2025-02-08 13:27:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:27:15,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:15,132 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:15,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:27:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:15,333 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1526607905, now seen corresponding path program 1 times [2025-02-08 13:27:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106169266] [2025-02-08 13:27:15,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:15,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:15,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:15,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:15,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:27:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106169266] [2025-02-08 13:27:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106169266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499961101] [2025-02-08 13:27:15,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:15,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:15,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:15,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:15,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:27:16,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:16,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:16,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:16,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:16,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:16,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:27:16,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:27:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499961101] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:16,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:27:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910956955] [2025-02-08 13:27:16,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:16,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:27:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:16,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:27:16,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:16,799 INFO L87 Difference]: Start difference. First operand 306 states and 387 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:20,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:24,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:28,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:32,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:36,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:36,974 INFO L93 Difference]: Finished difference Result 588 states and 752 transitions. [2025-02-08 13:27:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:27:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:27:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:36,976 INFO L225 Difference]: With dead ends: 588 [2025-02-08 13:27:36,976 INFO L226 Difference]: Without dead ends: 324 [2025-02-08 13:27:36,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:36,977 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:36,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 551 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-08 13:27:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-08 13:27:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-02-08 13:27:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 284 states have (on average 1.369718309859155) internal successors, (389), 309 states have internal predecessors, (389), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 405 transitions. [2025-02-08 13:27:36,984 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 405 transitions. Word has length 55 [2025-02-08 13:27:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:36,984 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 405 transitions. [2025-02-08 13:27:36,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 405 transitions. [2025-02-08 13:27:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 13:27:36,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:36,985 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:36,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 13:27:37,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 13:27:37,185 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:37,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 828433242, now seen corresponding path program 1 times [2025-02-08 13:27:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262882195] [2025-02-08 13:27:37,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:27:37,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:27:37,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:37,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:37,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262882195] [2025-02-08 13:27:37,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262882195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672254623] [2025-02-08 13:27:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:37,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:37,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:37,594 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:37,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:27:38,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:27:38,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:27:38,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:38,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:38,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1853 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:38,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:38,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:27:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672254623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:27:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:27:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096642063] [2025-02-08 13:27:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:38,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:27:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:38,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:27:38,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:38,614 INFO L87 Difference]: Start difference. First operand 324 states and 405 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:38,686 INFO L93 Difference]: Finished difference Result 435 states and 553 transitions. [2025-02-08 13:27:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:27:38,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 13:27:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:38,688 INFO L225 Difference]: With dead ends: 435 [2025-02-08 13:27:38,688 INFO L226 Difference]: Without dead ends: 434 [2025-02-08 13:27:38,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:38,689 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 279 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:38,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 693 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-02-08 13:27:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 323. [2025-02-08 13:27:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 284 states have (on average 1.3661971830985915) internal successors, (388), 308 states have internal predecessors, (388), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 404 transitions. [2025-02-08 13:27:38,697 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 404 transitions. Word has length 57 [2025-02-08 13:27:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:38,697 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 404 transitions. [2025-02-08 13:27:38,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 404 transitions. [2025-02-08 13:27:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 13:27:38,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:38,698 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:38,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:27:38,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:38,902 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -88371909, now seen corresponding path program 1 times [2025-02-08 13:27:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910524321] [2025-02-08 13:27:38,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:39,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:27:39,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:27:39,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:39,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:39,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910524321] [2025-02-08 13:27:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910524321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691647954] [2025-02-08 13:27:39,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:39,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:39,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:39,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:27:40,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:27:40,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:27:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:40,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:40,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:40,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:40,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691647954] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:40,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:40,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:27:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243040759] [2025-02-08 13:27:40,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:40,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:27:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:40,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:27:40,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:40,471 INFO L87 Difference]: Start difference. First operand 323 states and 404 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:40,615 INFO L93 Difference]: Finished difference Result 780 states and 1014 transitions. [2025-02-08 13:27:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:27:40,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-02-08 13:27:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:40,618 INFO L225 Difference]: With dead ends: 780 [2025-02-08 13:27:40,619 INFO L226 Difference]: Without dead ends: 779 [2025-02-08 13:27:40,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:40,620 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 699 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:40,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1387 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-02-08 13:27:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 335. [2025-02-08 13:27:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 296 states have (on average 1.3614864864864864) internal successors, (403), 320 states have internal predecessors, (403), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 419 transitions. [2025-02-08 13:27:40,633 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 419 transitions. Word has length 58 [2025-02-08 13:27:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 419 transitions. [2025-02-08 13:27:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 419 transitions. [2025-02-08 13:27:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 13:27:40,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:40,634 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:40,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 13:27:40,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:27:40,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:40,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1724706732, now seen corresponding path program 1 times [2025-02-08 13:27:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032888764] [2025-02-08 13:27:40,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:41,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 13:27:41,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 13:27:41,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:41,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:41,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:41,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032888764] [2025-02-08 13:27:41,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032888764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:41,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:41,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:41,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796570802] [2025-02-08 13:27:41,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:41,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:41,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:41,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:41,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:41,210 INFO L87 Difference]: Start difference. First operand 335 states and 419 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:41,290 INFO L93 Difference]: Finished difference Result 582 states and 746 transitions. [2025-02-08 13:27:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-02-08 13:27:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:41,293 INFO L225 Difference]: With dead ends: 582 [2025-02-08 13:27:41,293 INFO L226 Difference]: Without dead ends: 428 [2025-02-08 13:27:41,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:41,293 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 113 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:41,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 500 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-08 13:27:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 377. [2025-02-08 13:27:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.3590504451038576) internal successors, (458), 361 states have internal predecessors, (458), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:27:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 476 transitions. [2025-02-08 13:27:41,305 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 476 transitions. Word has length 67 [2025-02-08 13:27:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:41,305 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 476 transitions. [2025-02-08 13:27:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 476 transitions. [2025-02-08 13:27:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 13:27:41,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:41,306 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:41,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:27:41,306 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:41,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -414163894, now seen corresponding path program 1 times [2025-02-08 13:27:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894279810] [2025-02-08 13:27:41,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:41,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:27:41,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:27:41,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:41,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:41,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894279810] [2025-02-08 13:27:41,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894279810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:41,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:41,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496331387] [2025-02-08 13:27:41,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:41,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:41,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:41,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:41,690 INFO L87 Difference]: Start difference. First operand 377 states and 476 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:27:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:41,722 INFO L93 Difference]: Finished difference Result 379 states and 476 transitions. [2025-02-08 13:27:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:41,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2025-02-08 13:27:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:41,723 INFO L225 Difference]: With dead ends: 379 [2025-02-08 13:27:41,723 INFO L226 Difference]: Without dead ends: 377 [2025-02-08 13:27:41,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:41,724 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:41,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 550 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:27:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-08 13:27:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-02-08 13:27:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.3531157270029674) internal successors, (456), 361 states have internal predecessors, (456), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:27:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 474 transitions. [2025-02-08 13:27:41,738 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 474 transitions. Word has length 69 [2025-02-08 13:27:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:41,738 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 474 transitions. [2025-02-08 13:27:41,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:27:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 474 transitions. [2025-02-08 13:27:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 13:27:41,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:41,739 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:41,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 13:27:41,739 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:41,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash -236439825, now seen corresponding path program 2 times [2025-02-08 13:27:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659511789] [2025-02-08 13:27:41,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:27:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:42,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-08 13:27:42,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 70 statements. [2025-02-08 13:27:42,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:27:42,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:27:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659511789] [2025-02-08 13:27:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659511789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:27:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750530424] [2025-02-08 13:27:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:42,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:42,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:42,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:42,419 INFO L87 Difference]: Start difference. First operand 377 states and 474 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:42,449 INFO L93 Difference]: Finished difference Result 670 states and 847 transitions. [2025-02-08 13:27:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-02-08 13:27:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:42,451 INFO L225 Difference]: With dead ends: 670 [2025-02-08 13:27:42,451 INFO L226 Difference]: Without dead ends: 381 [2025-02-08 13:27:42,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:42,452 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 26 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:42,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 519 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:27:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-08 13:27:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-02-08 13:27:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 340 states have (on average 1.3470588235294119) internal successors, (458), 364 states have internal predecessors, (458), 11 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:27:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2025-02-08 13:27:42,461 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 70 [2025-02-08 13:27:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2025-02-08 13:27:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2025-02-08 13:27:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 13:27:42,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:42,462 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:42,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 13:27:42,463 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-02-08 13:27:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 38636401, now seen corresponding path program 2 times [2025-02-08 13:27:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906945798] [2025-02-08 13:27:42,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:27:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:42,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:27:42,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:27:42,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:27:42,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:27:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906945798] [2025-02-08 13:27:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906945798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391810022] [2025-02-08 13:27:42,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:27:42,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:42,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:42,973 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:42,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 13:27:43,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:27:44,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:27:44,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:27:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:44,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:44,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:27:44,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:27:44,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391810022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:44,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:44,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 13:27:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028806826] [2025-02-08 13:27:44,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:44,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:27:44,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:44,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:27:44,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:27:44,335 INFO L87 Difference]: Start difference. First operand 381 states and 476 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)