./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/head-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:59:29,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:59:29,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 17:59:29,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:59:29,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:59:29,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:59:29,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:59:29,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:59:29,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:59:29,696 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:59:29,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:59:29,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:59:29,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:59:29,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:59:29,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:59:29,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:59:29,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:59:29,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:59:29,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:59:29,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:59:29,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:59:29,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:59:29,700 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 -> 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c [2025-02-06 17:59:29,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:59:29,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:59:29,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:59:29,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:59:29,964 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:59:29,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-02-06 17:59:31,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36fcec4f8/11a816054aaa4f62aa7375cc62e5d0af/FLAG85993b958 [2025-02-06 17:59:31,493 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:59:31,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-02-06 17:59:31,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36fcec4f8/11a816054aaa4f62aa7375cc62e5d0af/FLAG85993b958 [2025-02-06 17:59:31,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36fcec4f8/11a816054aaa4f62aa7375cc62e5d0af [2025-02-06 17:59:31,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:59:31,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:59:31,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:59:31,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:59:31,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:59:31,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:59:31" (1/1) ... [2025-02-06 17:59:31,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1cf783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:31, skipping insertion in model container [2025-02-06 17:59:31,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:59:31" (1/1) ... [2025-02-06 17:59:31,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:59:32,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:59:32,471 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:59:32,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:59:32,722 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 17:59:32,728 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:59:32,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32 WrapperNode [2025-02-06 17:59:32,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:59:32,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:59:32,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:59:32,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:59:32,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,835 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1397 [2025-02-06 17:59:32,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:59:32,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:59:32,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:59:32,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:59:32,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,915 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 3, 9, 3, 3, 2, 2, 9, 18, 47, 7, 24, 10, 4, 355, 1, 32, 20, 15]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 0, 0, 3, 2, 0, 1, 0, 2, 0, 0, 7, 1, 355, 0, 2, 4, 0]. The 120 writes are split as follows [0, 0, 6, 3, 0, 0, 1, 4, 4, 35, 7, 21, 0, 1, 0, 1, 21, 15, 1]. [2025-02-06 17:59:32,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:32,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:33,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:33,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:59:33,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:59:33,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:59:33,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:59:33,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (1/1) ... [2025-02-06 17:59:33,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:59:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:33,123 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-06 17:59:33,125 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-06 17:59:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-06 17:59:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-06 17:59:33,141 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-06 17:59:33,141 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-06 17:59:33,141 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-06 17:59:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 17:59:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 17:59:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 17:59:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 17:59:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 17:59:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 17:59:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 17:59:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-06 17:59:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 17:59:33,146 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 17:59:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 17:59:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 17:59:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:59:33,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-06 17:59:33,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-06 17:59:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-06 17:59:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-06 17:59:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-06 17:59:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 17:59:33,151 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 17:59:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-02-06 17:59:33,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-02-06 17:59:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 17:59:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 17:59:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-06 17:59:33,153 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 17:59:33,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 17:59:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-02-06 17:59:33,154 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 17:59:33,154 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 17:59:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 17:59:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 17:59:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 17:59:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 17:59:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 17:59:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 17:59:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 17:59:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 17:59:33,541 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:59:33,543 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:59:33,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-02-06 17:59:34,095 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-02-06 17:59:38,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-02-06 17:59:38,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-02-06 17:59:39,090 INFO L? ?]: Removed 600 outVars from TransFormulas that were not future-live. [2025-02-06 17:59:39,091 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:59:39,118 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:59:39,118 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:59:39,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:59:39 BoogieIcfgContainer [2025-02-06 17:59:39,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:59:39,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:59:39,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:59:39,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:59:39,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:59:31" (1/3) ... [2025-02-06 17:59:39,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6237dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:59:39, skipping insertion in model container [2025-02-06 17:59:39,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:32" (2/3) ... [2025-02-06 17:59:39,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6237dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:59:39, skipping insertion in model container [2025-02-06 17:59:39,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:59:39" (3/3) ... [2025-02-06 17:59:39,129 INFO L128 eAbstractionObserver]: Analyzing ICFG head-3.i [2025-02-06 17:59:39,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:59:39,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-3.i that has 48 procedures, 538 locations, 1 initial locations, 41 loop locations, and 54 error locations. [2025-02-06 17:59:39,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:59:39,208 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;@76f99db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:59:39,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-02-06 17:59:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 301 states have (on average 1.5913621262458473) internal successors, (479), 359 states have internal predecessors, (479), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 17:59:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 17:59:39,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:39,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 17:59:39,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:39,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash 25703615, now seen corresponding path program 1 times [2025-02-06 17:59:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:39,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480392619] [2025-02-06 17:59:39,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:39,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 17:59:39,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 17:59:39,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:39,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:40,350 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-06 17:59:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480392619] [2025-02-06 17:59:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480392619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339925461] [2025-02-06 17:59:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:40,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:40,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:40,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:40,378 INFO L87 Difference]: Start difference. First operand has 397 states, 301 states have (on average 1.5913621262458473) internal successors, (479), 359 states have internal predecessors, (479), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-06 17:59:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:40,508 INFO L93 Difference]: Finished difference Result 665 states and 934 transitions. [2025-02-06 17:59:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:40,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-06 17:59:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:40,517 INFO L225 Difference]: With dead ends: 665 [2025-02-06 17:59:40,517 INFO L226 Difference]: Without dead ends: 272 [2025-02-06 17:59:40,521 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-06 17:59:40,523 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:40,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 702 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-06 17:59:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-02-06 17:59:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 219 states have (on average 1.45662100456621) internal successors, (319), 245 states have internal predecessors, (319), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2025-02-06 17:59:40,578 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 4 [2025-02-06 17:59:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:40,580 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2025-02-06 17:59:40,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-06 17:59:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2025-02-06 17:59:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 17:59:40,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:40,580 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 17:59:40,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:59:40,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:40,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:40,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1232979520, now seen corresponding path program 1 times [2025-02-06 17:59:40,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:40,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733136157] [2025-02-06 17:59:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:41,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:59:41,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:59:41,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:41,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:41,431 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-06 17:59:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733136157] [2025-02-06 17:59:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733136157] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713347715] [2025-02-06 17:59:41,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:41,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:41,434 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-06 17:59:41,435 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-06 17:59:42,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:59:42,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:59:42,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:42,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:42,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:59:42,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:42,374 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-06 17:59:42,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713347715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 17:59:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393609493] [2025-02-06 17:59:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:42,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:59:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:42,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:59:42,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:42,375 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-06 17:59:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:42,473 INFO L93 Difference]: Finished difference Result 272 states and 359 transitions. [2025-02-06 17:59:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:59:42,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-06 17:59:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:42,479 INFO L225 Difference]: With dead ends: 272 [2025-02-06 17:59:42,479 INFO L226 Difference]: Without dead ends: 271 [2025-02-06 17:59:42,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:42,480 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:42,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1045 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-06 17:59:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-06 17:59:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 219 states have (on average 1.452054794520548) internal successors, (318), 244 states have internal predecessors, (318), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2025-02-06 17:59:42,501 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 7 [2025-02-06 17:59:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:42,501 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2025-02-06 17:59:42,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-06 17:59:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2025-02-06 17:59:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 17:59:42,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:42,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 17:59:42,513 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-06 17:59:42,703 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-06 17:59:42,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash -432339775, now seen corresponding path program 1 times [2025-02-06 17:59:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:42,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532461770] [2025-02-06 17:59:42,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:43,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 17:59:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 17:59:43,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:43,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:43,343 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-06 17:59:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:43,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532461770] [2025-02-06 17:59:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532461770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737703092] [2025-02-06 17:59:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:43,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:43,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:43,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:43,345 INFO L87 Difference]: Start difference. First operand 271 states and 358 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-06 17:59:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:43,389 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2025-02-06 17:59:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-06 17:59:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:43,391 INFO L225 Difference]: With dead ends: 271 [2025-02-06 17:59:43,392 INFO L226 Difference]: Without dead ends: 270 [2025-02-06 17:59:43,392 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-06 17:59:43,392 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:43,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 698 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-06 17:59:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2025-02-06 17:59:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 217 states have (on average 1.4516129032258065) internal successors, (315), 241 states have internal predecessors, (315), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2025-02-06 17:59:43,409 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 8 [2025-02-06 17:59:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:43,409 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2025-02-06 17:59:43,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-06 17:59:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2025-02-06 17:59:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 17:59:43,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:43,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:43,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:59:43,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:43,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -870486509, now seen corresponding path program 1 times [2025-02-06 17:59:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627312236] [2025-02-06 17:59:43,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:59:43,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:59:43,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:43,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:44,084 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-06 17:59:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627312236] [2025-02-06 17:59:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627312236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424881785] [2025-02-06 17:59:44,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:44,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:44,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:44,086 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-06 17:59:44,088 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-06 17:59:44,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:59:44,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:59:44,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:45,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 17:59:45,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:45,042 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-06 17:59:45,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424881785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 17:59:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250667649] [2025-02-06 17:59:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:45,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:45,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:45,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:45,044 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-06 17:59:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:45,100 INFO L93 Difference]: Finished difference Result 268 states and 355 transitions. [2025-02-06 17:59:45,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:45,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 12 [2025-02-06 17:59:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:45,102 INFO L225 Difference]: With dead ends: 268 [2025-02-06 17:59:45,102 INFO L226 Difference]: Without dead ends: 266 [2025-02-06 17:59:45,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:45,103 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 206 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:45,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 474 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-06 17:59:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-02-06 17:59:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 217 states have (on average 1.4423963133640554) internal successors, (313), 239 states have internal predecessors, (313), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2025-02-06 17:59:45,115 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 12 [2025-02-06 17:59:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:45,119 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2025-02-06 17:59:45,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-06 17:59:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2025-02-06 17:59:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 17:59:45,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:45,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:45,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 17:59:45,320 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-06 17:59:45,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:45,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1215277240, now seen corresponding path program 1 times [2025-02-06 17:59:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:45,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76772927] [2025-02-06 17:59:45,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:45,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:59:45,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:59:45,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:45,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:46,019 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-06 17:59:46,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76772927] [2025-02-06 17:59:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76772927] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037409621] [2025-02-06 17:59:46,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:46,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:46,022 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-06 17:59:46,025 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-06 17:59:46,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:59:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:59:46,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:46,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:59:46,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:46,951 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-06 17:59:46,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:59:47,067 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-06 17:59:47,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037409621] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:59:47,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:59:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 17:59:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263869292] [2025-02-06 17:59:47,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:59:47,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:59:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:47,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:59:47,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:47,069 INFO L87 Difference]: Start difference. First operand 266 states and 353 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-06 17:59:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:47,228 INFO L93 Difference]: Finished difference Result 535 states and 711 transitions. [2025-02-06 17:59:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:59:47,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 13 [2025-02-06 17:59:47,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:47,231 INFO L225 Difference]: With dead ends: 535 [2025-02-06 17:59:47,231 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 17:59:47,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:47,233 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 4 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:47,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1732 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 17:59:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-06 17:59:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 226 states have (on average 1.424778761061947) internal successors, (322), 248 states have internal predecessors, (322), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 362 transitions. [2025-02-06 17:59:47,245 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 362 transitions. Word has length 13 [2025-02-06 17:59:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:47,245 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 362 transitions. [2025-02-06 17:59:47,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-06 17:59:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 362 transitions. [2025-02-06 17:59:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 17:59:47,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:47,246 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:47,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 17:59:47,447 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-06 17:59:47,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:47,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash 621894471, now seen corresponding path program 2 times [2025-02-06 17:59:47,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:47,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970826500] [2025-02-06 17:59:47,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:59:47,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:47,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 17:59:48,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 17:59:48,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 17:59:48,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:48,468 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-06 17:59:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970826500] [2025-02-06 17:59:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970826500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:48,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:59:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699454492] [2025-02-06 17:59:48,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:48,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:59:48,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:48,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:59:48,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:48,470 INFO L87 Difference]: Start difference. First operand 275 states and 362 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-06 17:59:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:48,689 INFO L93 Difference]: Finished difference Result 275 states and 362 transitions. [2025-02-06 17:59:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:59:48,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-02-06 17:59:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:48,691 INFO L225 Difference]: With dead ends: 275 [2025-02-06 17:59:48,691 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 17:59:48,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:48,692 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 205 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1142 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:48,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1142 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 17:59:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 17:59:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-02-06 17:59:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.415929203539823) internal successors, (320), 246 states have internal predecessors, (320), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 360 transitions. [2025-02-06 17:59:48,703 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 360 transitions. Word has length 22 [2025-02-06 17:59:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:48,703 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 360 transitions. [2025-02-06 17:59:48,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-06 17:59:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 360 transitions. [2025-02-06 17:59:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 17:59:48,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:48,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:48,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 17:59:48,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:48,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1258289487, now seen corresponding path program 1 times [2025-02-06 17:59:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236528021] [2025-02-06 17:59:48,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:49,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 17:59:49,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 17:59:49,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:49,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:49,368 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-06 17:59:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236528021] [2025-02-06 17:59:49,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236528021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:49,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715811184] [2025-02-06 17:59:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:49,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:49,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:49,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:49,370 INFO L87 Difference]: Start difference. First operand 273 states and 360 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-06 17:59:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:49,443 INFO L93 Difference]: Finished difference Result 529 states and 704 transitions. [2025-02-06 17:59:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 27 [2025-02-06 17:59:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:49,446 INFO L225 Difference]: With dead ends: 529 [2025-02-06 17:59:49,446 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 17:59:49,446 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-06 17:59:49,447 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:49,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 687 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 17:59:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-02-06 17:59:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 229 states have (on average 1.4104803493449782) internal successors, (323), 249 states have internal predecessors, (323), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 363 transitions. [2025-02-06 17:59:49,466 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 363 transitions. Word has length 27 [2025-02-06 17:59:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:49,466 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 363 transitions. [2025-02-06 17:59:49,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-06 17:59:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 363 transitions. [2025-02-06 17:59:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 17:59:49,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:49,468 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:49,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 17:59:49,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:49,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash -771704416, now seen corresponding path program 1 times [2025-02-06 17:59:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045138260] [2025-02-06 17:59:49,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:49,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:59:49,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:59:49,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:49,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:50,123 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-06 17:59:50,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045138260] [2025-02-06 17:59:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045138260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998783913] [2025-02-06 17:59:50,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:50,128 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-06 17:59:50,129 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-06 17:59:50,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:59:51,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:59:51,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:51,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:51,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 17:59:51,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:51,440 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-06 17:59:51,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:59:51,929 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-06 17:59:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998783913] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:59:51,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:59:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 17:59:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756115380] [2025-02-06 17:59:51,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:59:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 17:59:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:51,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 17:59:51,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:59:51,930 INFO L87 Difference]: Start difference. First operand 276 states and 363 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-06 17:59:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:52,492 INFO L93 Difference]: Finished difference Result 554 states and 734 transitions. [2025-02-06 17:59:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 17:59:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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 30 [2025-02-06 17:59:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:52,496 INFO L225 Difference]: With dead ends: 554 [2025-02-06 17:59:52,497 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 17:59:52,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:59:52,498 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 5 mSDsluCounter, 2704 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:52,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3044 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 17:59:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 17:59:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-06 17:59:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 247 states have (on average 1.3765182186234817) internal successors, (340), 266 states have internal predecessors, (340), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 380 transitions. [2025-02-06 17:59:52,517 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 380 transitions. Word has length 30 [2025-02-06 17:59:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:52,517 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 380 transitions. [2025-02-06 17:59:52,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-06 17:59:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 380 transitions. [2025-02-06 17:59:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 17:59:52,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:52,518 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-06 17:59:52,529 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-06 17:59:52,718 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-06 17:59:52,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:52,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash 583616032, now seen corresponding path program 1 times [2025-02-06 17:59:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:52,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822370818] [2025-02-06 17:59:52,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:53,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 17:59:53,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 17:59:53,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:53,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:53,366 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-06 17:59:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822370818] [2025-02-06 17:59:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822370818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226069173] [2025-02-06 17:59:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:53,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:53,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:53,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:53,367 INFO L87 Difference]: Start difference. First operand 293 states and 380 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-06 17:59:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:53,469 INFO L93 Difference]: Finished difference Result 305 states and 394 transitions. [2025-02-06 17:59:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:53,470 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-06 17:59:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:53,472 INFO L225 Difference]: With dead ends: 305 [2025-02-06 17:59:53,472 INFO L226 Difference]: Without dead ends: 303 [2025-02-06 17:59:53,472 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-06 17:59:53,473 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 2 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 682 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:53,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 682 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-06 17:59:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2025-02-06 17:59:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 256 states have (on average 1.375) internal successors, (352), 275 states have internal predecessors, (352), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 392 transitions. [2025-02-06 17:59:53,487 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 392 transitions. Word has length 48 [2025-02-06 17:59:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:53,487 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 392 transitions. [2025-02-06 17:59:53,488 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-06 17:59:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 392 transitions. [2025-02-06 17:59:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 17:59:53,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:53,488 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] [2025-02-06 17:59:53,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 17:59:53,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:53,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:53,491 INFO L85 PathProgramCache]: Analyzing trace with hash 912233521, now seen corresponding path program 1 times [2025-02-06 17:59:53,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:53,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014944978] [2025-02-06 17:59:53,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:53,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:53,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 17:59:53,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 17:59:53,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:53,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:54,039 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-06 17:59:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:54,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014944978] [2025-02-06 17:59:54,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014944978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:54,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:54,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467205389] [2025-02-06 17:59:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:54,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:54,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:54,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:54,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:54,040 INFO L87 Difference]: Start difference. First operand 302 states and 392 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-06 17:59:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:54,083 INFO L93 Difference]: Finished difference Result 302 states and 392 transitions. [2025-02-06 17:59:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:54,084 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-06 17:59:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:54,086 INFO L225 Difference]: With dead ends: 302 [2025-02-06 17:59:54,086 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 17:59:54,086 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-06 17:59:54,086 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:54,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 17:59:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2025-02-06 17:59:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 252 states have (on average 1.373015873015873) internal successors, (346), 270 states have internal predecessors, (346), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 17:59:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 386 transitions. [2025-02-06 17:59:54,101 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 386 transitions. Word has length 49 [2025-02-06 17:59:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:54,101 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 386 transitions. [2025-02-06 17:59:54,101 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-06 17:59:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2025-02-06 17:59:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:59:54,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:54,104 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] [2025-02-06 17:59:54,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 17:59:54,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash -709776415, now seen corresponding path program 1 times [2025-02-06 17:59:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797206908] [2025-02-06 17:59:54,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:54,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:59:54,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:59:54,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:54,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:54,888 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-06 17:59:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797206908] [2025-02-06 17:59:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797206908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:54,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:54,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 17:59:54,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018251261] [2025-02-06 17:59:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:54,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:59:54,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:54,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:59:54,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:54,889 INFO L87 Difference]: Start difference. First operand 297 states and 386 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:56,775 INFO L93 Difference]: Finished difference Result 810 states and 1086 transitions. [2025-02-06 17:59:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 17:59:56,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-02-06 17:59:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:56,779 INFO L225 Difference]: With dead ends: 810 [2025-02-06 17:59:56,781 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 17:59:56,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:56,782 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 551 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:56,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 945 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 17:59:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 17:59:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 393. [2025-02-06 17:59:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 341 states have (on average 1.4076246334310851) internal successors, (480), 361 states have internal predecessors, (480), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2025-02-06 17:59:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 529 transitions. [2025-02-06 17:59:56,801 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 529 transitions. Word has length 55 [2025-02-06 17:59:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:56,802 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 529 transitions. [2025-02-06 17:59:56,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 529 transitions. [2025-02-06 17:59:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:59:56,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:56,804 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] [2025-02-06 17:59:56,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 17:59:56,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1777736418, now seen corresponding path program 1 times [2025-02-06 17:59:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:56,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835595534] [2025-02-06 17:59:56,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:57,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:59:57,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:59:57,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:57,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:57,731 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-06 17:59:57,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:57,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835595534] [2025-02-06 17:59:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835595534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 17:59:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727634512] [2025-02-06 17:59:57,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:57,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 17:59:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:57,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 17:59:57,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:59:57,732 INFO L87 Difference]: Start difference. First operand 393 states and 529 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:58,272 INFO L93 Difference]: Finished difference Result 510 states and 703 transitions. [2025-02-06 17:59:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 17:59:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-02-06 17:59:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:58,278 INFO L225 Difference]: With dead ends: 510 [2025-02-06 17:59:58,278 INFO L226 Difference]: Without dead ends: 509 [2025-02-06 17:59:58,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 17:59:58,279 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 132 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:58,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1283 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 17:59:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-06 17:59:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 492. [2025-02-06 17:59:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 434 states have (on average 1.4308755760368663) internal successors, (621), 456 states have internal predecessors, (621), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-02-06 17:59:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 683 transitions. [2025-02-06 17:59:58,303 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 683 transitions. Word has length 55 [2025-02-06 17:59:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:58,304 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 683 transitions. [2025-02-06 17:59:58,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 683 transitions. [2025-02-06 17:59:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:59:58,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:58,309 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] [2025-02-06 17:59:58,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 17:59:58,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:58,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1629727197, now seen corresponding path program 1 times [2025-02-06 17:59:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:58,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015607751] [2025-02-06 17:59:58,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:58,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:59:58,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:59:58,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:58,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:59,233 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-06 17:59:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015607751] [2025-02-06 17:59:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015607751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:59,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:59,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 17:59:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666961295] [2025-02-06 17:59:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:59,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 17:59:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:59,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 17:59:59,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:59:59,236 INFO L87 Difference]: Start difference. First operand 492 states and 683 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:59:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:59,509 INFO L93 Difference]: Finished difference Result 930 states and 1306 transitions. [2025-02-06 17:59:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:59:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2025-02-06 17:59:59,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:59,512 INFO L225 Difference]: With dead ends: 930 [2025-02-06 17:59:59,512 INFO L226 Difference]: Without dead ends: 492 [2025-02-06 17:59:59,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:59:59,513 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 213 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:59,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1319 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 17:59:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-02-06 17:59:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-02-06 17:59:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 434 states have (on average 1.4285714285714286) internal successors, (620), 456 states have internal predecessors, (620), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-02-06 17:59:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 682 transitions. [2025-02-06 17:59:59,529 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 682 transitions. Word has length 55 [2025-02-06 17:59:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:59,529 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 682 transitions. [2025-02-06 17:59:59,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:59:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 682 transitions. [2025-02-06 17:59:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:59:59,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:59,530 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:59,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 17:59:59,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 17:59:59,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:59,530 INFO L85 PathProgramCache]: Analyzing trace with hash 817773543, now seen corresponding path program 1 times [2025-02-06 17:59:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568841608] [2025-02-06 17:59:59,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:59,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:00:00,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:00:00,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:00,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:00:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568841608] [2025-02-06 18:00:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568841608] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:00:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036354567] [2025-02-06 18:00:00,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:00,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:00,240 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-06 18:00:00,242 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-06 18:00:01,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:00:01,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:00:01,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:01,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:01,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:00:01,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:00:01,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:00:01,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036354567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:01,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:00:01,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:00:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885047863] [2025-02-06 18:00:01,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:00:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:01,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:00:01,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:01,582 INFO L87 Difference]: Start difference. First operand 492 states and 682 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-06 18:00:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:01,716 INFO L93 Difference]: Finished difference Result 959 states and 1342 transitions. [2025-02-06 18:00:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:00:01,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-06 18:00:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:01,719 INFO L225 Difference]: With dead ends: 959 [2025-02-06 18:00:01,719 INFO L226 Difference]: Without dead ends: 510 [2025-02-06 18:00:01,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:01,722 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 4 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:01,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1367 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-06 18:00:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-02-06 18:00:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 452 states have (on average 1.4115044247787611) internal successors, (638), 474 states have internal predecessors, (638), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-02-06 18:00:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 700 transitions. [2025-02-06 18:00:01,741 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 700 transitions. Word has length 55 [2025-02-06 18:00:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:01,742 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 700 transitions. [2025-02-06 18:00:01,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-06 18:00:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 700 transitions. [2025-02-06 18:00:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 18:00:01,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:01,743 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:01,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:01,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 18:00:01,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:01,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1773070955, now seen corresponding path program 1 times [2025-02-06 18:00:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:01,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084573769] [2025-02-06 18:00:01,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:02,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 18:00:02,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 18:00:02,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:02,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:00:02,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084573769] [2025-02-06 18:00:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084573769] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:00:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835555134] [2025-02-06 18:00:02,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:02,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:02,823 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-06 18:00:02,825 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-06 18:00:04,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 18:00:04,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 18:00:04,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:04,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:04,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:00:04,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:00:04,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:00:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835555134] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:04,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:00:04,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 18:00:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102442123] [2025-02-06 18:00:04,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:04,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:00:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:04,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:00:04,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:00:04,840 INFO L87 Difference]: Start difference. First operand 510 states and 700 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-06 18:00:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:05,073 INFO L93 Difference]: Finished difference Result 1004 states and 1393 transitions. [2025-02-06 18:00:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:00:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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 71 [2025-02-06 18:00:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:05,077 INFO L225 Difference]: With dead ends: 1004 [2025-02-06 18:00:05,077 INFO L226 Difference]: Without dead ends: 546 [2025-02-06 18:00:05,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:00:05,080 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 4 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:05,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1367 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:00:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-02-06 18:00:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2025-02-06 18:00:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 488 states have (on average 1.3811475409836065) internal successors, (674), 510 states have internal predecessors, (674), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-02-06 18:00:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 736 transitions. [2025-02-06 18:00:05,112 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 736 transitions. Word has length 71 [2025-02-06 18:00:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:05,112 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 736 transitions. [2025-02-06 18:00:05,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-06 18:00:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 736 transitions. [2025-02-06 18:00:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 18:00:05,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:05,113 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-02-06 18:00:05,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:00:05,314 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,SelfDestructingSolverStorable14 [2025-02-06 18:00:05,314 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2090014325, now seen corresponding path program 2 times [2025-02-06 18:00:05,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773291430] [2025-02-06 18:00:05,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:00:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:05,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 18:00:05,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 89 statements. [2025-02-06 18:00:05,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:00:05,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:00:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:06,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773291430] [2025-02-06 18:00:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773291430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:06,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:00:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031413968] [2025-02-06 18:00:06,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:06,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:00:06,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:06,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:00:06,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:00:06,721 INFO L87 Difference]: Start difference. First operand 546 states and 736 transitions. Second operand has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:00:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:10,024 INFO L93 Difference]: Finished difference Result 815 states and 1110 transitions. [2025-02-06 18:00:10,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:00:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2025-02-06 18:00:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:10,028 INFO L225 Difference]: With dead ends: 815 [2025-02-06 18:00:10,028 INFO L226 Difference]: Without dead ends: 814 [2025-02-06 18:00:10,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:00:10,028 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 691 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:10,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1271 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-06 18:00:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-06 18:00:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 734. [2025-02-06 18:00:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 655 states have (on average 1.3969465648854962) internal successors, (915), 678 states have internal predecessors, (915), 43 states have call successors, (43), 20 states have call predecessors, (43), 23 states have return successors, (50), 37 states have call predecessors, (50), 37 states have call successors, (50) [2025-02-06 18:00:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1008 transitions. [2025-02-06 18:00:10,048 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1008 transitions. Word has length 89 [2025-02-06 18:00:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:10,048 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1008 transitions. [2025-02-06 18:00:10,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:00:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1008 transitions. [2025-02-06 18:00:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 18:00:10,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:10,050 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-02-06 18:00:10,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:00:10,050 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:10,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2108744333, now seen corresponding path program 1 times [2025-02-06 18:00:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:10,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504762295] [2025-02-06 18:00:10,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:10,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 18:00:10,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 18:00:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 18:00:11,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:11,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504762295] [2025-02-06 18:00:11,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504762295] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:00:11,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610853492] [2025-02-06 18:00:11,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:11,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:11,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:11,825 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-06 18:00:11,838 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-06 18:00:13,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 18:00:13,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 18:00:13,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:13,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:13,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:00:13,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 18:00:15,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 18:00:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610853492] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:16,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:00:16,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-02-06 18:00:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498130390] [2025-02-06 18:00:16,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:16,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 18:00:16,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:16,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 18:00:16,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-02-06 18:00:16,610 INFO L87 Difference]: Start difference. First operand 734 states and 1008 transitions. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 18:00:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:22,700 INFO L93 Difference]: Finished difference Result 1367 states and 1874 transitions. [2025-02-06 18:00:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 18:00:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 90 [2025-02-06 18:00:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:22,703 INFO L225 Difference]: With dead ends: 1367 [2025-02-06 18:00:22,703 INFO L226 Difference]: Without dead ends: 745 [2025-02-06 18:00:22,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 18:00:22,705 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1724 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:22,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 2470 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-06 18:00:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-02-06 18:00:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 712. [2025-02-06 18:00:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 630 states have (on average 1.3523809523809525) internal successors, (852), 655 states have internal predecessors, (852), 47 states have call successors, (47), 23 states have call predecessors, (47), 24 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2025-02-06 18:00:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 940 transitions. [2025-02-06 18:00:22,733 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 940 transitions. Word has length 90 [2025-02-06 18:00:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 940 transitions. [2025-02-06 18:00:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 18:00:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 940 transitions. [2025-02-06 18:00:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 18:00:22,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:22,735 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:22,749 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-06 18:00:22,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:22,936 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1643204275, now seen corresponding path program 1 times [2025-02-06 18:00:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:22,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122252582] [2025-02-06 18:00:22,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:23,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:00:23,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:00:23,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:23,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-02-06 18:00:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122252582] [2025-02-06 18:00:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122252582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:00:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750557997] [2025-02-06 18:00:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:23,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:00:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:23,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:00:23,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:00:23,923 INFO L87 Difference]: Start difference. First operand 712 states and 940 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:24,359 INFO L93 Difference]: Finished difference Result 1022 states and 1356 transitions. [2025-02-06 18:00:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:00:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-06 18:00:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:24,367 INFO L225 Difference]: With dead ends: 1022 [2025-02-06 18:00:24,367 INFO L226 Difference]: Without dead ends: 1020 [2025-02-06 18:00:24,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:00:24,368 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 882 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:24,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 898 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:00:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-02-06 18:00:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 832. [2025-02-06 18:00:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 742 states have (on average 1.3746630727762803) internal successors, (1020), 769 states have internal predecessors, (1020), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-02-06 18:00:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1119 transitions. [2025-02-06 18:00:24,410 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1119 transitions. Word has length 101 [2025-02-06 18:00:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:24,410 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1119 transitions. [2025-02-06 18:00:24,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1119 transitions. [2025-02-06 18:00:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 18:00:24,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:24,413 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:24,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:00:24,413 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:24,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1420052963, now seen corresponding path program 1 times [2025-02-06 18:00:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:24,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038458752] [2025-02-06 18:00:24,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:24,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:00:25,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:00:25,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:25,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:00:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038458752] [2025-02-06 18:00:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038458752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:25,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:25,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:00:25,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824933225] [2025-02-06 18:00:25,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:25,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:00:25,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:25,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:00:25,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:25,378 INFO L87 Difference]: Start difference. First operand 832 states and 1119 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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-06 18:00:29,404 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-06 18:00:33,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 18:00:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:33,828 INFO L93 Difference]: Finished difference Result 954 states and 1317 transitions. [2025-02-06 18:00:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:00:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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 101 [2025-02-06 18:00:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:33,835 INFO L225 Difference]: With dead ends: 954 [2025-02-06 18:00:33,835 INFO L226 Difference]: Without dead ends: 952 [2025-02-06 18:00:33,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:33,836 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 30 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:33,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1310 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-06 18:00:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-02-06 18:00:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 856. [2025-02-06 18:00:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 766 states have (on average 1.370757180156658) internal successors, (1050), 793 states have internal predecessors, (1050), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-02-06 18:00:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1149 transitions. [2025-02-06 18:00:33,873 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1149 transitions. Word has length 101 [2025-02-06 18:00:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:33,873 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1149 transitions. [2025-02-06 18:00:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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-06 18:00:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1149 transitions. [2025-02-06 18:00:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 18:00:33,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:33,875 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:33,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:00:33,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:33,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1420082754, now seen corresponding path program 1 times [2025-02-06 18:00:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:33,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650402016] [2025-02-06 18:00:33,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:34,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:00:34,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:00:34,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:34,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:00:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650402016] [2025-02-06 18:00:34,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650402016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:34,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:34,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:00:34,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516819765] [2025-02-06 18:00:34,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:34,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:00:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:34,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:00:34,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:34,697 INFO L87 Difference]: Start difference. First operand 856 states and 1149 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:34,881 INFO L93 Difference]: Finished difference Result 1536 states and 2096 transitions. [2025-02-06 18:00:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:00:34,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-06 18:00:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:34,887 INFO L225 Difference]: With dead ends: 1536 [2025-02-06 18:00:34,887 INFO L226 Difference]: Without dead ends: 832 [2025-02-06 18:00:34,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:34,891 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:34,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1355 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-06 18:00:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 828. [2025-02-06 18:00:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 735 states have (on average 1.3564625850340135) internal successors, (997), 762 states have internal predecessors, (997), 50 states have call successors, (50), 26 states have call predecessors, (50), 32 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-02-06 18:00:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1101 transitions. [2025-02-06 18:00:34,931 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1101 transitions. Word has length 101 [2025-02-06 18:00:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:34,931 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1101 transitions. [2025-02-06 18:00:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1101 transitions. [2025-02-06 18:00:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:00:34,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:34,933 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:34,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:00:34,933 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:34,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash 972360935, now seen corresponding path program 1 times [2025-02-06 18:00:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:34,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507520042] [2025-02-06 18:00:34,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:34,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:35,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:00:35,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:00:35,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:35,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:00:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:35,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507520042] [2025-02-06 18:00:35,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507520042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:35,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:35,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:00:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589809085] [2025-02-06 18:00:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:35,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:00:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:35,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:00:35,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:35,992 INFO L87 Difference]: Start difference. First operand 828 states and 1101 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:36,183 INFO L93 Difference]: Finished difference Result 841 states and 1113 transitions. [2025-02-06 18:00:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:00:36,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-06 18:00:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:36,187 INFO L225 Difference]: With dead ends: 841 [2025-02-06 18:00:36,187 INFO L226 Difference]: Without dead ends: 837 [2025-02-06 18:00:36,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:36,188 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 15 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:36,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1355 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-06 18:00:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 833. [2025-02-06 18:00:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 739 states have (on average 1.3558863328822734) internal successors, (1002), 766 states have internal predecessors, (1002), 50 states have call successors, (50), 27 states have call predecessors, (50), 33 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-02-06 18:00:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1106 transitions. [2025-02-06 18:00:36,234 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1106 transitions. Word has length 103 [2025-02-06 18:00:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:36,236 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1106 transitions. [2025-02-06 18:00:36,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1106 transitions. [2025-02-06 18:00:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:00:36,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:36,238 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:00:36,238 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:36,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 972390726, now seen corresponding path program 1 times [2025-02-06 18:00:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47698083] [2025-02-06 18:00:36,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:36,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:36,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:00:36,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:00:36,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:36,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:00:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47698083] [2025-02-06 18:00:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47698083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:00:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936165295] [2025-02-06 18:00:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:00:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:37,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:00:37,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:00:37,463 INFO L87 Difference]: Start difference. First operand 833 states and 1106 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:00:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:37,709 INFO L93 Difference]: Finished difference Result 1556 states and 2136 transitions. [2025-02-06 18:00:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:00:37,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-02-06 18:00:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:37,718 INFO L225 Difference]: With dead ends: 1556 [2025-02-06 18:00:37,719 INFO L226 Difference]: Without dead ends: 1248 [2025-02-06 18:00:37,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:37,722 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 176 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1082 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:37,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1082 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:00:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-02-06 18:00:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1069. [2025-02-06 18:00:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 970 states have (on average 1.3917525773195876) internal successors, (1350), 994 states have internal predecessors, (1350), 55 states have call successors, (55), 27 states have call predecessors, (55), 33 states have return successors, (75), 49 states have call predecessors, (75), 43 states have call successors, (75) [2025-02-06 18:00:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1480 transitions. [2025-02-06 18:00:37,770 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1480 transitions. Word has length 103 [2025-02-06 18:00:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:37,771 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1480 transitions. [2025-02-06 18:00:37,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:00:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1480 transitions. [2025-02-06 18:00:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:00:37,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:37,772 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:37,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 18:00:37,772 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:37,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash -386064266, now seen corresponding path program 1 times [2025-02-06 18:00:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:37,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056037210] [2025-02-06 18:00:37,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:38,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:00:38,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:00:38,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:38,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:00:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056037210] [2025-02-06 18:00:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056037210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:39,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:00:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575886452] [2025-02-06 18:00:39,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:39,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:00:39,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:39,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:00:39,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:39,142 INFO L87 Difference]: Start difference. First operand 1069 states and 1480 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-06 18:00:43,172 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-06 18:00:47,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 18:00:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:48,105 INFO L93 Difference]: Finished difference Result 1550 states and 2137 transitions. [2025-02-06 18:00:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:00:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 104 [2025-02-06 18:00:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:48,111 INFO L225 Difference]: With dead ends: 1550 [2025-02-06 18:00:48,112 INFO L226 Difference]: Without dead ends: 1259 [2025-02-06 18:00:48,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:48,114 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 454 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:48,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1100 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-02-06 18:00:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-02-06 18:00:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1097. [2025-02-06 18:00:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 996 states have (on average 1.3895582329317269) internal successors, (1384), 1020 states have internal predecessors, (1384), 57 states have call successors, (57), 27 states have call predecessors, (57), 33 states have return successors, (77), 51 states have call predecessors, (77), 45 states have call successors, (77) [2025-02-06 18:00:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1518 transitions. [2025-02-06 18:00:48,145 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1518 transitions. Word has length 104 [2025-02-06 18:00:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:48,145 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1518 transitions. [2025-02-06 18:00:48,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-06 18:00:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1518 transitions. [2025-02-06 18:00:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:00:48,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:48,147 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:48,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:00:48,147 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-02-06 18:00:48,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash -891622891, now seen corresponding path program 1 times [2025-02-06 18:00:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:00:48,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071410084] [2025-02-06 18:00:48,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:00:48,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:00:48,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:00:48,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:48,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:00:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:00:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071410084] [2025-02-06 18:00:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071410084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:51,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 18:00:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541919301] [2025-02-06 18:00:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:51,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:00:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:00:51,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:00:51,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:00:51,302 INFO L87 Difference]: Start difference. First operand 1097 states and 1518 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)