./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/tac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/tac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 46628777f37166701e524c73726938b34ff0d4ac1e6886ace9aa906687735189 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:42:43,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:42:44,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:42:44,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:42:44,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:42:44,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:42:44,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:42:44,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:42:44,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:42:44,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:42:44,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:42:44,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:42:44,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:42:44,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:42:44,069 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:42:44,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:42:44,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:42:44,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:42:44,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:42:44,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:42:44,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:42:44,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:42:44,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:42:44,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:42:44,072 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/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 -> 46628777f37166701e524c73726938b34ff0d4ac1e6886ace9aa906687735189 [2025-03-04 14:42:44,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:42:44,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:42:44,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:42:44,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:42:44,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:42:44,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/tac-1.i [2025-03-04 14:42:45,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38735f7a3/27c13cc5cf874c0ebe01a7785d82fd21/FLAG8bc2f7b95 [2025-03-04 14:42:45,822 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:42:45,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/tac-1.i [2025-03-04 14:42:45,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38735f7a3/27c13cc5cf874c0ebe01a7785d82fd21/FLAG8bc2f7b95 [2025-03-04 14:42:46,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38735f7a3/27c13cc5cf874c0ebe01a7785d82fd21 [2025-03-04 14:42:46,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:42:46,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:42:46,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:42:46,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:42:46,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:42:46,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:46,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7696888c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46, skipping insertion in model container [2025-03-04 14:42:46,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:46,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:42:46,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:42:46,751 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:42:46,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:42:46,985 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:42:46,990 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:42:46,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46 WrapperNode [2025-03-04 14:42:46,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:42:46,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:42:46,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:42:46,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:42:46,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,102 INFO L138 Inliner]: procedures = 575, calls = 742, calls flagged for inlining = 26, calls inlined = 25, statements flattened = 1951 [2025-03-04 14:42:47,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:42:47,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:42:47,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:42:47,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:42:47,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,192 INFO L175 MemorySlicer]: Split 629 memory accesses to 19 slices as follows [2, 3, 15, 79, 44, 20, 3, 2, 2, 19, 34, 3, 12, 17, 355, 3, 3, 6, 7]. 56 percent of accesses are in the largest equivalence class. The 381 initializations are split as follows [2, 0, 0, 4, 0, 4, 3, 2, 0, 0, 5, 0, 1, 4, 355, 0, 0, 0, 1]. The 101 writes are split as follows [0, 0, 1, 51, 12, 15, 0, 0, 1, 4, 0, 0, 5, 4, 0, 0, 0, 6, 2]. [2025-03-04 14:42:47,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:42:47,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:42:47,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:42:47,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:42:47,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (1/1) ... [2025-03-04 14:42:47,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:42:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:47,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:42:47,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:42:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 14:42:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 14:42:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 14:42:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 14:42:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 14:42:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 14:42:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 14:42:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-04 14:42:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-04 14:42:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:42:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 14:42:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 14:42:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:42:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 14:42:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 14:42:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:42:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:42:47,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:42:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:42:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:42:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:42:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:42:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:42:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:42:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:42:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:42:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 14:42:47,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 14:42:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:42:47,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:42:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 14:42:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-03-04 14:42:47,369 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:42:47,369 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:42:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 14:42:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 14:42:47,860 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:42:47,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:42:50,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3052: havoc _IO_getc_#t~nondet237#1; [2025-03-04 14:42:50,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-04 14:42:50,684 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3103: havoc getopt_long_#t~ret266#1; [2025-03-04 14:42:50,684 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: call ULTIMATE.dealloc(__main_~#list~0#1.base, __main_~#list~0#1.offset);havoc __main_~#list~0#1.base, __main_~#list~0#1.offset; [2025-03-04 14:42:50,915 INFO L? ?]: Removed 783 outVars from TransFormulas that were not future-live. [2025-03-04 14:42:50,915 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:42:50,956 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:42:50,956 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:42:50,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:50 BoogieIcfgContainer [2025-03-04 14:42:50,956 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:42:50,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:42:50,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:42:50,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:42:50,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:42:46" (1/3) ... [2025-03-04 14:42:50,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20598a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:50, skipping insertion in model container [2025-03-04 14:42:50,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:46" (2/3) ... [2025-03-04 14:42:50,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20598a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:50, skipping insertion in model container [2025-03-04 14:42:50,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:50" (3/3) ... [2025-03-04 14:42:50,968 INFO L128 eAbstractionObserver]: Analyzing ICFG tac-1.i [2025-03-04 14:42:50,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:42:50,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tac-1.i that has 65 procedures, 752 locations, 1 initial locations, 69 loop locations, and 64 error locations. [2025-03-04 14:42:51,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:42:51,049 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;@64da72ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:42:51,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2025-03-04 14:42:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 544 states, 438 states have (on average 1.6415525114155252) internal successors, (719), 506 states have internal predecessors, (719), 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-03-04 14:42:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:42:51,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:51,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:42:51,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:51,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash 36908991, now seen corresponding path program 1 times [2025-03-04 14:42:51,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:51,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454827257] [2025-03-04 14:42:51,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:51,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:42:51,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:42:51,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:51,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:51,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454827257] [2025-03-04 14:42:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454827257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073195216] [2025-03-04 14:42:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:51,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:51,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:51,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:51,811 INFO L87 Difference]: Start difference. First operand has 544 states, 438 states have (on average 1.6415525114155252) internal successors, (719), 506 states have internal predecessors, (719), 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-03-04 14:42:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:51,960 INFO L93 Difference]: Finished difference Result 1016 states and 1480 transitions. [2025-03-04 14:42:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:51,962 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-03-04 14:42:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:51,970 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 14:42:51,970 INFO L226 Difference]: Without dead ends: 473 [2025-03-04 14:42:51,975 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-03-04 14:42:51,977 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:51,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1255 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-04 14:42:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-03-04 14:42:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 391 states have (on average 1.5626598465473145) internal successors, (611), 444 states have internal predecessors, (611), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 652 transitions. [2025-03-04 14:42:52,027 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 652 transitions. Word has length 4 [2025-03-04 14:42:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:52,028 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 652 transitions. [2025-03-04 14:42:52,028 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-03-04 14:42:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 652 transitions. [2025-03-04 14:42:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:42:52,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:52,029 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:42:52,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:42:52,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:52,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 45248300, now seen corresponding path program 1 times [2025-03-04 14:42:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855943075] [2025-03-04 14:42:52,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:52,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:42:52,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:42:52,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:52,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:52,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855943075] [2025-03-04 14:42:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855943075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:42:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938432532] [2025-03-04 14:42:52,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:52,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:52,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:42:52,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:42:53,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:42:53,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:53,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:53,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:53,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:53,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938432532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:53,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:42:53,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:42:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915418727] [2025-03-04 14:42:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:53,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:42:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:53,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:42:53,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:53,070 INFO L87 Difference]: Start difference. First operand 473 states and 652 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-03-04 14:42:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:53,156 INFO L93 Difference]: Finished difference Result 473 states and 652 transitions. [2025-03-04 14:42:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:42:53,156 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-03-04 14:42:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:53,158 INFO L225 Difference]: With dead ends: 473 [2025-03-04 14:42:53,158 INFO L226 Difference]: Without dead ends: 472 [2025-03-04 14:42:53,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:53,159 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:53,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1867 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-04 14:42:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-04 14:42:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 391 states have (on average 1.5601023017902813) internal successors, (610), 443 states have internal predecessors, (610), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 651 transitions. [2025-03-04 14:42:53,186 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 651 transitions. Word has length 7 [2025-03-04 14:42:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:53,186 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 651 transitions. [2025-03-04 14:42:53,186 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-03-04 14:42:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 651 transitions. [2025-03-04 14:42:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:42:53,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:53,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:42:53,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:42:53,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:53,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:53,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1402698433, now seen corresponding path program 1 times [2025-03-04 14:42:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081956767] [2025-03-04 14:42:53,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:53,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:42:53,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:42:53,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:53,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:42:53,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:53,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081956767] [2025-03-04 14:42:53,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081956767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:53,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:53,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791224673] [2025-03-04 14:42:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:53,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:53,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:53,668 INFO L87 Difference]: Start difference. First operand 472 states and 651 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-03-04 14:42:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:53,729 INFO L93 Difference]: Finished difference Result 472 states and 651 transitions. [2025-03-04 14:42:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:53,730 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-03-04 14:42:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:53,732 INFO L225 Difference]: With dead ends: 472 [2025-03-04 14:42:53,732 INFO L226 Difference]: Without dead ends: 471 [2025-03-04 14:42:53,732 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-03-04 14:42:53,732 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 0 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:53,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1246 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:42:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-04 14:42:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2025-03-04 14:42:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 389 states have (on average 1.5604113110539846) internal successors, (607), 440 states have internal predecessors, (607), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 648 transitions. [2025-03-04 14:42:53,751 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 648 transitions. Word has length 8 [2025-03-04 14:42:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:53,751 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 648 transitions. [2025-03-04 14:42:53,751 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-03-04 14:42:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 648 transitions. [2025-03-04 14:42:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:42:53,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:53,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:42:53,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:53,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -229899484, now seen corresponding path program 1 times [2025-03-04 14:42:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254791883] [2025-03-04 14:42:53,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:53,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:42:53,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:42:53,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:53,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254791883] [2025-03-04 14:42:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254791883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:42:54,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237526961] [2025-03-04 14:42:54,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:54,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:54,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:54,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:42:54,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:42:54,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:42:54,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:54,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:54,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:54,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:42:54,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:54,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237526961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:54,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:42:54,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:42:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119862664] [2025-03-04 14:42:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:54,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:54,669 INFO L87 Difference]: Start difference. First operand 469 states and 648 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-03-04 14:42:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:54,741 INFO L93 Difference]: Finished difference Result 469 states and 648 transitions. [2025-03-04 14:42:54,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:54,743 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-03-04 14:42:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:54,745 INFO L225 Difference]: With dead ends: 469 [2025-03-04 14:42:54,745 INFO L226 Difference]: Without dead ends: 467 [2025-03-04 14:42:54,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:54,746 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 519 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:54,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 724 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-04 14:42:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-04 14:42:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 389 states have (on average 1.5552699228791773) internal successors, (605), 438 states have internal predecessors, (605), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 646 transitions. [2025-03-04 14:42:54,762 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 646 transitions. Word has length 12 [2025-03-04 14:42:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:54,763 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 646 transitions. [2025-03-04 14:42:54,764 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-03-04 14:42:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 646 transitions. [2025-03-04 14:42:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:42:54,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:54,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:54,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 14:42:54,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 14:42:54,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1463051715, now seen corresponding path program 1 times [2025-03-04 14:42:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195598045] [2025-03-04 14:42:54,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:54,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:55,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:42:55,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:42:55,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:55,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:55,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195598045] [2025-03-04 14:42:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195598045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:42:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048635256] [2025-03-04 14:42:55,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:55,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:55,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:55,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:42:55,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:42:55,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:42:55,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:55,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:55,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:55,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:55,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:42:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048635256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:42:55,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:42:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:42:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401784113] [2025-03-04 14:42:55,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:42:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:42:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:55,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:42:55,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:42:55,875 INFO L87 Difference]: Start difference. First operand 467 states and 646 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-03-04 14:42:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:55,971 INFO L93 Difference]: Finished difference Result 937 states and 1297 transitions. [2025-03-04 14:42:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:55,971 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-03-04 14:42:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:55,973 INFO L225 Difference]: With dead ends: 937 [2025-03-04 14:42:55,974 INFO L226 Difference]: Without dead ends: 476 [2025-03-04 14:42:55,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:42:55,975 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 4 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:55,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1862 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-04 14:42:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2025-03-04 14:42:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 398 states have (on average 1.5427135678391959) internal successors, (614), 447 states have internal predecessors, (614), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 655 transitions. [2025-03-04 14:42:55,985 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 655 transitions. Word has length 13 [2025-03-04 14:42:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:55,986 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 655 transitions. [2025-03-04 14:42:55,986 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-03-04 14:42:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 655 transitions. [2025-03-04 14:42:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:42:55,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:55,986 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:55,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:42:56,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:56,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:56,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1804988970, now seen corresponding path program 2 times [2025-03-04 14:42:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304774996] [2025-03-04 14:42:56,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:42:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:56,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:42:56,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:42:56,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:42:56,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:42:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304774996] [2025-03-04 14:42:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304774996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:56,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:42:56,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881246401] [2025-03-04 14:42:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:56,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:42:56,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:56,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:42:56,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:56,644 INFO L87 Difference]: Start difference. First operand 476 states and 655 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-03-04 14:42:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:56,768 INFO L93 Difference]: Finished difference Result 476 states and 655 transitions. [2025-03-04 14:42:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:42:56,769 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-03-04 14:42:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:56,771 INFO L225 Difference]: With dead ends: 476 [2025-03-04 14:42:56,771 INFO L226 Difference]: Without dead ends: 474 [2025-03-04 14:42:56,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:56,772 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 518 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:56,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1933 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-04 14:42:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2025-03-04 14:42:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 398 states have (on average 1.5376884422110553) internal successors, (612), 445 states have internal predecessors, (612), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 653 transitions. [2025-03-04 14:42:56,791 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 653 transitions. Word has length 22 [2025-03-04 14:42:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:56,791 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 653 transitions. [2025-03-04 14:42:56,791 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-03-04 14:42:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 653 transitions. [2025-03-04 14:42:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:42:56,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:56,792 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:42:56,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:56,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2046815724, now seen corresponding path program 1 times [2025-03-04 14:42:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109977585] [2025-03-04 14:42:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:56,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:42:56,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:42:56,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:42:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:57,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109977585] [2025-03-04 14:42:57,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109977585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:57,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:57,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:42:57,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904203485] [2025-03-04 14:42:57,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:57,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:57,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:57,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:57,110 INFO L87 Difference]: Start difference. First operand 474 states and 653 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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-03-04 14:42:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:57,182 INFO L93 Difference]: Finished difference Result 931 states and 1290 transitions. [2025-03-04 14:42:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-03-04 14:42:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:57,184 INFO L225 Difference]: With dead ends: 931 [2025-03-04 14:42:57,184 INFO L226 Difference]: Without dead ends: 477 [2025-03-04 14:42:57,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:57,185 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 2 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:57,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1235 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-04 14:42:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-03-04 14:42:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 401 states have (on average 1.5336658354114714) internal successors, (615), 448 states have internal predecessors, (615), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 656 transitions. [2025-03-04 14:42:57,202 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 656 transitions. Word has length 27 [2025-03-04 14:42:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:57,202 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 656 transitions. [2025-03-04 14:42:57,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-03-04 14:42:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 656 transitions. [2025-03-04 14:42:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 14:42:57,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:57,204 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:57,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:42:57,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash -973555536, now seen corresponding path program 1 times [2025-03-04 14:42:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:57,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277774793] [2025-03-04 14:42:57,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:57,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 14:42:57,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 14:42:57,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:57,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:42:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277774793] [2025-03-04 14:42:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277774793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818034487] [2025-03-04 14:42:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:57,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:57,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:57,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:57,484 INFO L87 Difference]: Start difference. First operand 477 states and 656 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-03-04 14:42:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:57,581 INFO L93 Difference]: Finished difference Result 775 states and 1094 transitions. [2025-03-04 14:42:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 28 [2025-03-04 14:42:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:57,585 INFO L225 Difference]: With dead ends: 775 [2025-03-04 14:42:57,585 INFO L226 Difference]: Without dead ends: 773 [2025-03-04 14:42:57,585 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-03-04 14:42:57,586 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 412 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:57,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1222 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-04 14:42:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 481. [2025-03-04 14:42:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 405 states have (on average 1.5308641975308641) internal successors, (620), 452 states have internal predecessors, (620), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 661 transitions. [2025-03-04 14:42:57,604 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 661 transitions. Word has length 28 [2025-03-04 14:42:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:57,604 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 661 transitions. [2025-03-04 14:42:57,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-03-04 14:42:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 661 transitions. [2025-03-04 14:42:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:42:57,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:57,605 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:57,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:42:57,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:57,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1042408079, now seen corresponding path program 1 times [2025-03-04 14:42:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:57,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156910532] [2025-03-04 14:42:57,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:57,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:42:57,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:42:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:42:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156910532] [2025-03-04 14:42:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156910532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:57,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:57,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266120138] [2025-03-04 14:42:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:57,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:57,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:57,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:57,862 INFO L87 Difference]: Start difference. First operand 481 states and 661 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-03-04 14:42:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:57,930 INFO L93 Difference]: Finished difference Result 494 states and 676 transitions. [2025-03-04 14:42:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:57,930 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 30 [2025-03-04 14:42:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:57,934 INFO L225 Difference]: With dead ends: 494 [2025-03-04 14:42:57,934 INFO L226 Difference]: Without dead ends: 492 [2025-03-04 14:42:57,934 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-03-04 14:42:57,936 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 3 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:57,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1232 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-04 14:42:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2025-03-04 14:42:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 414 states have (on average 1.5289855072463767) internal successors, (633), 461 states have internal predecessors, (633), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 674 transitions. [2025-03-04 14:42:57,949 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 674 transitions. Word has length 30 [2025-03-04 14:42:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:57,950 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 674 transitions. [2025-03-04 14:42:57,950 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-03-04 14:42:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 674 transitions. [2025-03-04 14:42:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:42:57,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:57,951 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-03-04 14:42:57,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:42:57,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1042408239, now seen corresponding path program 1 times [2025-03-04 14:42:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334032776] [2025-03-04 14:42:57,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:58,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:42:58,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:42:58,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:58,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:42:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334032776] [2025-03-04 14:42:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334032776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:42:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411362596] [2025-03-04 14:42:58,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:58,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:58,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:58,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:42:58,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:42:58,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:42:58,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:58,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:58,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:42:58,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:42:59,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:42:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:42:59,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411362596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:42:59,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:42:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:42:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858706019] [2025-03-04 14:42:59,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:42:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:42:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:59,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:42:59,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:42:59,108 INFO L87 Difference]: Start difference. First operand 490 states and 674 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-03-04 14:42:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:59,323 INFO L93 Difference]: Finished difference Result 982 states and 1356 transitions. [2025-03-04 14:42:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:42:59,324 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-03-04 14:42:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:59,326 INFO L225 Difference]: With dead ends: 982 [2025-03-04 14:42:59,326 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 14:42:59,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:42:59,327 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 5 mSDsluCounter, 3672 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4286 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:59,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4286 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:42:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 14:42:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-04 14:42:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 432 states have (on average 1.5023148148148149) internal successors, (649), 478 states have internal predecessors, (649), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 690 transitions. [2025-03-04 14:42:59,339 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 690 transitions. Word has length 30 [2025-03-04 14:42:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:59,339 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 690 transitions. [2025-03-04 14:42:59,339 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-03-04 14:42:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 690 transitions. [2025-03-04 14:42:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:42:59,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:59,340 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-03-04 14:42:59,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:42:59,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:59,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:59,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 165696622, now seen corresponding path program 1 times [2025-03-04 14:42:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:59,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343002098] [2025-03-04 14:42:59,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:59,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:59,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:42:59,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:42:59,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:59,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:42:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343002098] [2025-03-04 14:42:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343002098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:59,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215421510] [2025-03-04 14:42:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:59,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:59,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:59,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:59,809 INFO L87 Difference]: Start difference. First operand 507 states and 690 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-03-04 14:42:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:59,869 INFO L93 Difference]: Finished difference Result 507 states and 690 transitions. [2025-03-04 14:42:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:59,870 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-03-04 14:42:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:59,872 INFO L225 Difference]: With dead ends: 507 [2025-03-04 14:42:59,872 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 14:42:59,872 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-03-04 14:42:59,872 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:59,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1233 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:42:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 14:42:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 502. [2025-03-04 14:42:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 428 states have (on average 1.5023364485981308) internal successors, (643), 473 states have internal predecessors, (643), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2025-03-04 14:42:59,889 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 49 [2025-03-04 14:42:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:59,890 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2025-03-04 14:42:59,890 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-03-04 14:42:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2025-03-04 14:42:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:42:59,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:59,890 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:59,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:42:59,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:42:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 730264084, now seen corresponding path program 1 times [2025-03-04 14:42:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502960828] [2025-03-04 14:42:59,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:00,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:43:00,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:43:00,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:00,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502960828] [2025-03-04 14:43:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502960828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390347143] [2025-03-04 14:43:00,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:00,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:00,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:00,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:43:00,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:43:00,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:43:00,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:00,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:00,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:00,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:00,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:43:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390347143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:43:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:43:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525904409] [2025-03-04 14:43:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:43:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:00,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:43:00,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:00,871 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-03-04 14:43:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:01,043 INFO L93 Difference]: Finished difference Result 798 states and 1120 transitions. [2025-03-04 14:43:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:43:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 50 [2025-03-04 14:43:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:01,047 INFO L225 Difference]: With dead ends: 798 [2025-03-04 14:43:01,047 INFO L226 Difference]: Without dead ends: 797 [2025-03-04 14:43:01,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:01,049 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 823 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:01,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1849 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-04 14:43:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 501. [2025-03-04 14:43:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 428 states have (on average 1.5) internal successors, (642), 472 states have internal predecessors, (642), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 683 transitions. [2025-03-04 14:43:01,065 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 683 transitions. Word has length 50 [2025-03-04 14:43:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:01,065 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 683 transitions. [2025-03-04 14:43:01,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-03-04 14:43:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2025-03-04 14:43:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:43:01,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:01,068 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:01,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:43:01,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 14:43:01,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:43:01,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1163351227, now seen corresponding path program 1 times [2025-03-04 14:43:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140401805] [2025-03-04 14:43:01,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:01,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:43:01,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:43:01,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:01,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140401805] [2025-03-04 14:43:01,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140401805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843444232] [2025-03-04 14:43:01,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:01,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:01,582 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:01,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:43:02,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:43:02,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:43:02,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:02,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:02,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:02,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:02,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843444232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:02,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:43:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689203758] [2025-03-04 14:43:02,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:02,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:02,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:02,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:02,261 INFO L87 Difference]: Start difference. First operand 501 states and 683 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-03-04 14:43:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:02,515 INFO L93 Difference]: Finished difference Result 1682 states and 2425 transitions. [2025-03-04 14:43:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:02,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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 51 [2025-03-04 14:43:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:02,521 INFO L225 Difference]: With dead ends: 1682 [2025-03-04 14:43:02,521 INFO L226 Difference]: Without dead ends: 1681 [2025-03-04 14:43:02,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:02,522 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 3196 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3224 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:02,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3224 Valid, 2806 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:43:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-03-04 14:43:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 513. [2025-03-04 14:43:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 440 states have (on average 1.4931818181818182) internal successors, (657), 484 states have internal predecessors, (657), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 698 transitions. [2025-03-04 14:43:02,542 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 698 transitions. Word has length 51 [2025-03-04 14:43:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:02,543 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 698 transitions. [2025-03-04 14:43:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-03-04 14:43:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 698 transitions. [2025-03-04 14:43:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:43:02,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:02,545 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-03-04 14:43:02,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:43:02,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:02,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:43:02,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash 761496292, now seen corresponding path program 1 times [2025-03-04 14:43:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277839763] [2025-03-04 14:43:02,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:02,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:43:02,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:43:02,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:02,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:43:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277839763] [2025-03-04 14:43:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277839763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101321164] [2025-03-04 14:43:03,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:03,097 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:43:03,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:43:03,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:43:03,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:03,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:03,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:03,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:43:03,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:43:03,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101321164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:03,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:43:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602417148] [2025-03-04 14:43:03,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:03,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:03,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:03,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:03,786 INFO L87 Difference]: Start difference. First operand 513 states and 698 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-03-04 14:43:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:03,859 INFO L93 Difference]: Finished difference Result 1001 states and 1373 transitions. [2025-03-04 14:43:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:03,861 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-03-04 14:43:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:03,863 INFO L225 Difference]: With dead ends: 1001 [2025-03-04 14:43:03,863 INFO L226 Difference]: Without dead ends: 531 [2025-03-04 14:43:03,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:03,864 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 4 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:03,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1231 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-04 14:43:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-04 14:43:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 458 states have (on average 1.4737991266375545) internal successors, (675), 502 states have internal predecessors, (675), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 716 transitions. [2025-03-04 14:43:03,879 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 716 transitions. Word has length 55 [2025-03-04 14:43:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:03,879 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 716 transitions. [2025-03-04 14:43:03,879 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-03-04 14:43:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 716 transitions. [2025-03-04 14:43:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:43:03,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:03,880 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:03,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:43:04,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:04,080 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:43:04,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash 833689390, now seen corresponding path program 1 times [2025-03-04 14:43:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884471026] [2025-03-04 14:43:04,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:04,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:43:04,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:43:04,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:04,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884471026] [2025-03-04 14:43:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884471026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:43:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849138861] [2025-03-04 14:43:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:04,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:43:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:04,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:43:04,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:04,704 INFO L87 Difference]: Start difference. First operand 531 states and 716 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:08,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:43:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:08,897 INFO L93 Difference]: Finished difference Result 962 states and 1319 transitions. [2025-03-04 14:43:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:43:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-04 14:43:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:08,899 INFO L225 Difference]: With dead ends: 962 [2025-03-04 14:43:08,899 INFO L226 Difference]: Without dead ends: 532 [2025-03-04 14:43:08,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:43:08,902 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 1018 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:08,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 967 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 14:43:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-04 14:43:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 531. [2025-03-04 14:43:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 458 states have (on average 1.4694323144104804) internal successors, (673), 502 states have internal predecessors, (673), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 714 transitions. [2025-03-04 14:43:08,918 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 714 transitions. Word has length 60 [2025-03-04 14:43:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:08,918 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 714 transitions. [2025-03-04 14:43:08,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 714 transitions. [2025-03-04 14:43:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:43:08,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:08,919 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:08,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:43:08,919 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:43:08,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1718467571, now seen corresponding path program 1 times [2025-03-04 14:43:08,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:08,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728683434] [2025-03-04 14:43:08,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:09,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:43:09,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:43:09,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:09,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:09,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:09,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728683434] [2025-03-04 14:43:09,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728683434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:09,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:09,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:09,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791803514] [2025-03-04 14:43:09,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:09,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:09,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:09,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:09,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:09,211 INFO L87 Difference]: Start difference. First operand 531 states and 714 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:09,358 INFO L93 Difference]: Finished difference Result 1053 states and 1451 transitions. [2025-03-04 14:43:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-04 14:43:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:09,361 INFO L225 Difference]: With dead ends: 1053 [2025-03-04 14:43:09,361 INFO L226 Difference]: Without dead ends: 626 [2025-03-04 14:43:09,362 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-03-04 14:43:09,362 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 118 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:09,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1155 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-04 14:43:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 573. [2025-03-04 14:43:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 499 states have (on average 1.4609218436873748) internal successors, (729), 543 states have internal predecessors, (729), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 772 transitions. [2025-03-04 14:43:09,380 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 772 transitions. Word has length 60 [2025-03-04 14:43:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 772 transitions. [2025-03-04 14:43:09,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 772 transitions. [2025-03-04 14:43:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:43:09,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:09,381 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:09,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:43:09,382 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:43:09,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2115107755, now seen corresponding path program 1 times [2025-03-04 14:43:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:09,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118780496] [2025-03-04 14:43:09,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:09,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:43:09,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:43:09,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:09,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118780496] [2025-03-04 14:43:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118780496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651839807] [2025-03-04 14:43:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:09,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:09,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:09,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:09,666 INFO L87 Difference]: Start difference. First operand 573 states and 772 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-03-04 14:43:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:09,738 INFO L93 Difference]: Finished difference Result 575 states and 772 transitions. [2025-03-04 14:43:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 62 [2025-03-04 14:43:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:09,741 INFO L225 Difference]: With dead ends: 575 [2025-03-04 14:43:09,741 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 14:43:09,742 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-03-04 14:43:09,742 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:09,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1227 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 14:43:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-03-04 14:43:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 499 states have (on average 1.4569138276553106) internal successors, (727), 543 states have internal predecessors, (727), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 770 transitions. [2025-03-04 14:43:09,759 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 770 transitions. Word has length 62 [2025-03-04 14:43:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:09,759 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 770 transitions. [2025-03-04 14:43:09,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-03-04 14:43:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 770 transitions. [2025-03-04 14:43:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 14:43:09,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:09,760 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:09,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 14:43:09,760 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:43:09,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash 41011695, now seen corresponding path program 2 times [2025-03-04 14:43:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:09,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370893496] [2025-03-04 14:43:09,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:09,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-04 14:43:09,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-04 14:43:09,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:43:09,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-04 14:43:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370893496] [2025-03-04 14:43:10,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370893496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:10,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:10,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:43:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16949639] [2025-03-04 14:43:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:10,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:43:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:10,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:43:10,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:43:10,163 INFO L87 Difference]: Start difference. First operand 573 states and 770 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-03-04 14:43:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:10,370 INFO L93 Difference]: Finished difference Result 1074 states and 1462 transitions. [2025-03-04 14:43:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:10,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 63 [2025-03-04 14:43:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:10,372 INFO L225 Difference]: With dead ends: 1074 [2025-03-04 14:43:10,372 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 14:43:10,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:43:10,374 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 523 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:10,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2391 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:43:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 14:43:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-03-04 14:43:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 499 states have (on average 1.4549098196392785) internal successors, (726), 543 states have internal predecessors, (726), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 769 transitions. [2025-03-04 14:43:10,390 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 769 transitions. Word has length 63 [2025-03-04 14:43:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 769 transitions. [2025-03-04 14:43:10,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-03-04 14:43:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 769 transitions. [2025-03-04 14:43:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:43:10,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:10,394 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:10,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:43:10,394 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-03-04 14:43:10,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 627026388, now seen corresponding path program 2 times [2025-03-04 14:43:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083146495] [2025-03-04 14:43:10,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:10,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:43:10,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:43:10,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:43:10,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 14:43:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083146495] [2025-03-04 14:43:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083146495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855636705] [2025-03-04 14:43:10,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:10,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:10,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:10,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:43:11,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.