./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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/head-3.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 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:39:44,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:39:45,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:39:45,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:39:45,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:39:45,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:39:45,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:39:45,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:39:45,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:39:45,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:39:45,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:39:45,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:39:45,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:39:45,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:39:45,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:39:45,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:39:45,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:39:45,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:39:45,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:39:45,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:39:45,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:39:45,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:39:45,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:45,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:39:45,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:39:45,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:39:45,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:39:45,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:39:45,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:39:45,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:39:45,069 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 -> 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c [2025-03-04 14:39:45,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:39:45,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:39:45,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:39:45,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:39:45,287 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:39:45,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-03-04 14:39:46,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b59cf23/20598b6c05fc44babfe3313b03fd4b26/FLAGda92a686c [2025-03-04 14:39:46,809 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:39:46,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-03-04 14:39:46,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b59cf23/20598b6c05fc44babfe3313b03fd4b26/FLAGda92a686c [2025-03-04 14:39:47,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b59cf23/20598b6c05fc44babfe3313b03fd4b26 [2025-03-04 14:39:47,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:39:47,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:39:47,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:47,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:39:47,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:39:47,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:47,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d0a907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47, skipping insertion in model container [2025-03-04 14:39:47,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:47,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:39:47,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:47,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:39:47,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:47,942 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:39:47,948 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:39:47,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47 WrapperNode [2025-03-04 14:39:47,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:47,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:47,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:39:47,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:39:47,953 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:39:47" (1/1) ... [2025-03-04 14:39:47,996 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:39:47" (1/1) ... [2025-03-04 14:39:48,052 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1397 [2025-03-04 14:39:48,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:48,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:39:48,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:39:48,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:39:48,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,135 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 15, 32, 1, 7, 3, 2, 47, 20, 4, 3, 18, 9, 24, 2, 10, 355, 3, 9]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 2, 0, 0, 3, 2, 2, 4, 1, 0, 0, 1, 0, 0, 7, 355, 0, 0]. The 120 writes are split as follows [0, 1, 21, 1, 7, 0, 0, 35, 15, 1, 0, 4, 4, 21, 1, 0, 0, 3, 6]. [2025-03-04 14:39:48,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:39:48,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:39:48,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:39:48,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:39:48,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (1/1) ... [2025-03-04 14:39:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:48,274 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:39:48,276 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:39:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:48,296 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:48,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:48,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:48,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:48,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:48,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:48,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-03-04 14:39:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-04 14:39:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 14:39:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:39:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:39:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:39:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:39:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:39:48,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:48,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:48,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:48,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-03-04 14:39:48,306 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 14:39:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 14:39:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 14:39:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 14:39:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 14:39:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 14:39:48,309 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:39:48,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:39:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-03-04 14:39:48,310 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:39:48,310 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:39:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:39:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:39:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 14:39:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 14:39:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 14:39:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 14:39:48,759 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:39:48,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:39:48,953 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-03-04 14:39:49,344 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-03-04 14:39:53,996 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-03-04 14:39:53,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-03-04 14:39:54,177 INFO L? ?]: Removed 600 outVars from TransFormulas that were not future-live. [2025-03-04 14:39:54,179 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:39:54,210 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:39:54,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:39:54,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:54 BoogieIcfgContainer [2025-03-04 14:39:54,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:39:54,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:39:54,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:39:54,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:39:54,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:39:47" (1/3) ... [2025-03-04 14:39:54,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35825050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:54, skipping insertion in model container [2025-03-04 14:39:54,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:47" (2/3) ... [2025-03-04 14:39:54,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35825050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:54, skipping insertion in model container [2025-03-04 14:39:54,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:54" (3/3) ... [2025-03-04 14:39:54,224 INFO L128 eAbstractionObserver]: Analyzing ICFG head-3.i [2025-03-04 14:39:54,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:39:54,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-3.i that has 48 procedures, 533 locations, 1 initial locations, 41 loop locations, and 54 error locations. [2025-03-04 14:39:54,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:39:54,296 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;@6db36ac4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:39:54,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-03-04 14:39:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 297 states have (on average 1.595959595959596) internal successors, (474), 354 states have internal predecessors, (474), 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:39:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:39:54,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:54,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:39:54,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:39:54,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash 25549695, now seen corresponding path program 1 times [2025-03-04 14:39:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204158813] [2025-03-04 14:39:54,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:55,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:39:55,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:39:55,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:55,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:55,565 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:39:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204158813] [2025-03-04 14:39:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204158813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:55,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:55,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479475842] [2025-03-04 14:39:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:55,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:55,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:55,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:55,592 INFO L87 Difference]: Start difference. First operand has 392 states, 297 states have (on average 1.595959595959596) internal successors, (474), 354 states have internal predecessors, (474), 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:39:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:55,707 INFO L93 Difference]: Finished difference Result 656 states and 925 transitions. [2025-03-04 14:39:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:55,709 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:39:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:55,715 INFO L225 Difference]: With dead ends: 656 [2025-03-04 14:39:55,715 INFO L226 Difference]: Without dead ends: 268 [2025-03-04 14:39:55,719 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:39:55,721 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:55,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 694 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-04 14:39:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-04 14:39:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 215 states have (on average 1.4651162790697674) internal successors, (315), 241 states have internal predecessors, (315), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:39:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2025-03-04 14:39:55,765 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 4 [2025-03-04 14:39:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:55,765 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2025-03-04 14:39:55,765 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:39:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2025-03-04 14:39:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:39:55,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:55,766 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:39:55,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:39:55,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:39:55,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash 942511131, now seen corresponding path program 1 times [2025-03-04 14:39:55,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:55,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075078153] [2025-03-04 14:39:55,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:56,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:56,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:56,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:56,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:56,588 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:39:56,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075078153] [2025-03-04 14:39:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075078153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40822139] [2025-03-04 14:39:56,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:56,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:56,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:56,591 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:39:56,593 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:39:57,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:57,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:57,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:57,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:57,667 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:39:57,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40822139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:57,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:57,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:39:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323716214] [2025-03-04 14:39:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:57,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:57,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:57,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:57,669 INFO L87 Difference]: Start difference. First operand 268 states and 355 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:39:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:57,739 INFO L93 Difference]: Finished difference Result 268 states and 355 transitions. [2025-03-04 14:39:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:57,740 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:39:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:57,741 INFO L225 Difference]: With dead ends: 268 [2025-03-04 14:39:57,744 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 14:39:57,744 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:39:57,744 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:57,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 14:39:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-04 14:39:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 215 states have (on average 1.4604651162790698) internal successors, (314), 240 states have internal predecessors, (314), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:39:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 354 transitions. [2025-03-04 14:39:57,760 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 354 transitions. Word has length 7 [2025-03-04 14:39:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:57,761 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 354 transitions. [2025-03-04 14:39:57,761 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:39:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 354 transitions. [2025-03-04 14:39:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:39:57,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:57,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:39:57,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:39:57,963 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:39:57,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:39:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash -846925247, now seen corresponding path program 1 times [2025-03-04 14:39:57,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:57,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811270559] [2025-03-04 14:39:57,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:58,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:39:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:39:58,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,561 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:39:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811270559] [2025-03-04 14:39:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811270559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:58,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:58,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692108778] [2025-03-04 14:39:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:58,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:58,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:58,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:58,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:58,562 INFO L87 Difference]: Start difference. First operand 267 states and 354 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:39:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:58,597 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2025-03-04 14:39:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:58,599 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:39:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:58,600 INFO L225 Difference]: With dead ends: 267 [2025-03-04 14:39:58,601 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 14:39:58,601 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:39:58,602 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:58,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 14:39:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2025-03-04 14:39:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 213 states have (on average 1.460093896713615) internal successors, (311), 237 states have internal predecessors, (311), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:39:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2025-03-04 14:39:58,616 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 8 [2025-03-04 14:39:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:58,616 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2025-03-04 14:39:58,616 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:39:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2025-03-04 14:39:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:39:58,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:58,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:58,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:39:58,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:39:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -100986760, now seen corresponding path program 1 times [2025-03-04 14:39:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:58,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136024566] [2025-03-04 14:39:58,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:59,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:59,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:59,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:59,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:59,366 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:39:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136024566] [2025-03-04 14:39:59,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136024566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:59,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357103689] [2025-03-04 14:39:59,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:59,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:59,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:59,369 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:39:59,370 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:40:00,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:40:00,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:40:00,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:00,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:00,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:40:00,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:00,225 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:40:00,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357103689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:00,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:40:00,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:40:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340103097] [2025-03-04 14:40:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:00,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:00,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:00,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:00,227 INFO L87 Difference]: Start difference. First operand 264 states and 351 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:40:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:00,269 INFO L93 Difference]: Finished difference Result 264 states and 351 transitions. [2025-03-04 14:40:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:00,270 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:40:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:00,271 INFO L225 Difference]: With dead ends: 264 [2025-03-04 14:40:00,271 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 14:40:00,271 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:40:00,272 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 204 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:00,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 468 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 14:40:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-03-04 14:40:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.4507042253521127) internal successors, (309), 235 states have internal predecessors, (309), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 349 transitions. [2025-03-04 14:40:00,285 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 349 transitions. Word has length 12 [2025-03-04 14:40:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:00,286 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 349 transitions. [2025-03-04 14:40:00,286 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:40:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2025-03-04 14:40:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:40:00,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:00,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:00,296 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:40:00,487 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:40:00,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:00,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1164378494, now seen corresponding path program 1 times [2025-03-04 14:40:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801287624] [2025-03-04 14:40:00,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:00,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:40:00,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:40:00,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:00,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:01,112 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:40:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801287624] [2025-03-04 14:40:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801287624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656164127] [2025-03-04 14:40:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:01,115 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:40:01,117 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:40:01,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:40:02,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:40:02,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:02,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:02,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:02,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:02,073 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:40:02,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:02,148 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:40:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656164127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:02,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:02,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:40:02,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944832040] [2025-03-04 14:40:02,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:02,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:02,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:02,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:02,149 INFO L87 Difference]: Start difference. First operand 262 states and 349 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:40:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:02,218 INFO L93 Difference]: Finished difference Result 527 states and 703 transitions. [2025-03-04 14:40:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:02,219 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:40:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:02,220 INFO L225 Difference]: With dead ends: 527 [2025-03-04 14:40:02,220 INFO L226 Difference]: Without dead ends: 271 [2025-03-04 14:40:02,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:02,221 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 4 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:02,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1370 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-04 14:40:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-04 14:40:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.4324324324324325) internal successors, (318), 244 states have internal predecessors, (318), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2025-03-04 14:40:02,229 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 13 [2025-03-04 14:40:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2025-03-04 14:40:02,230 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:40:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2025-03-04 14:40:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:40:02,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:02,230 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:02,240 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:40:02,430 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:40:02,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:02,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1278173922, now seen corresponding path program 2 times [2025-03-04 14:40:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948501923] [2025-03-04 14:40:02,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:02,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:40:02,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:40:02,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:40:02,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:03,227 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:40:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948501923] [2025-03-04 14:40:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948501923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:03,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:03,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621738070] [2025-03-04 14:40:03,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:03,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:03,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:03,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:03,229 INFO L87 Difference]: Start difference. First operand 271 states and 358 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:40:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:03,380 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2025-03-04 14:40:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:03,381 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:40:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:03,382 INFO L225 Difference]: With dead ends: 271 [2025-03-04 14:40:03,382 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 14:40:03,383 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:40:03,384 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 203 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:03,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1128 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 14:40:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-04 14:40:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 222 states have (on average 1.4234234234234233) internal successors, (316), 242 states have internal predecessors, (316), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 356 transitions. [2025-03-04 14:40:03,394 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 356 transitions. Word has length 22 [2025-03-04 14:40:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:03,396 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 356 transitions. [2025-03-04 14:40:03,396 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:40:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 356 transitions. [2025-03-04 14:40:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:40:03,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:03,397 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:40:03,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:40:03,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:03,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash -523982033, now seen corresponding path program 1 times [2025-03-04 14:40:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:03,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300906627] [2025-03-04 14:40:03,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:03,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:40:03,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:40:03,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:04,026 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:40:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300906627] [2025-03-04 14:40:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300906627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122138344] [2025-03-04 14:40:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:04,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:04,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:04,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:04,028 INFO L87 Difference]: Start difference. First operand 269 states and 356 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:40:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:04,091 INFO L93 Difference]: Finished difference Result 521 states and 696 transitions. [2025-03-04 14:40:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:04,092 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:40:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:04,093 INFO L225 Difference]: With dead ends: 521 [2025-03-04 14:40:04,093 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 14:40:04,094 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:40:04,094 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 2 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:04,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 679 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 14:40:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-04 14:40:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 245 states have internal predecessors, (319), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2025-03-04 14:40:04,103 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 27 [2025-03-04 14:40:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:04,104 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2025-03-04 14:40:04,104 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:40:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2025-03-04 14:40:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:04,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:04,105 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:40:04,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:40:04,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2032082149, now seen corresponding path program 1 times [2025-03-04 14:40:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916908212] [2025-03-04 14:40:04,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:04,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:04,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:04,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:04,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:04,700 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:40:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:04,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916908212] [2025-03-04 14:40:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916908212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:04,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:04,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28600136] [2025-03-04 14:40:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:04,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:04,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:04,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:04,702 INFO L87 Difference]: Start difference. First operand 272 states and 359 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:40:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:04,785 INFO L93 Difference]: Finished difference Result 285 states and 374 transitions. [2025-03-04 14:40:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:04,785 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:40:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:04,787 INFO L225 Difference]: With dead ends: 285 [2025-03-04 14:40:04,788 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 14:40:04,789 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:40:04,789 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 3 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:04,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 676 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 14:40:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2025-03-04 14:40:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 234 states have (on average 1.4188034188034189) internal successors, (332), 254 states have internal predecessors, (332), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2025-03-04 14:40:04,800 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 30 [2025-03-04 14:40:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:04,801 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2025-03-04 14:40:04,801 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:40:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2025-03-04 14:40:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:04,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:04,802 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:40:04,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:40:04,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2032081989, now seen corresponding path program 1 times [2025-03-04 14:40:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862015861] [2025-03-04 14:40:04,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:05,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:05,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:05,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:05,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:05,440 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:40:05,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862015861] [2025-03-04 14:40:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862015861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86051699] [2025-03-04 14:40:05,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:05,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:05,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:05,444 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:40:05,445 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:40:06,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:06,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:06,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:06,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:06,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:06,738 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:40:06,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:07,033 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:40:07,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86051699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:07,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:07,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:40:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329978280] [2025-03-04 14:40:07,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:07,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:40:07,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:07,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:40:07,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:07,034 INFO L87 Difference]: Start difference. First operand 281 states and 372 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:40:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:07,437 INFO L93 Difference]: Finished difference Result 564 states and 752 transitions. [2025-03-04 14:40:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:40:07,438 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:40:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:07,440 INFO L225 Difference]: With dead ends: 564 [2025-03-04 14:40:07,440 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 14:40:07,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:07,441 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 5 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:07,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2340 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:40:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 14:40:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-04 14:40:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 252 states have (on average 1.380952380952381) internal successors, (348), 271 states have internal predecessors, (348), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 388 transitions. [2025-03-04 14:40:07,454 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 388 transitions. Word has length 30 [2025-03-04 14:40:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:07,455 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 388 transitions. [2025-03-04 14:40:07,455 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:40:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 388 transitions. [2025-03-04 14:40:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:40:07,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:07,456 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:40:07,469 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:40:07,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:07,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1631962897, now seen corresponding path program 1 times [2025-03-04 14:40:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702171874] [2025-03-04 14:40:07,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:08,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:40:08,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:40:08,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:08,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:08,292 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:40:08,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:08,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702171874] [2025-03-04 14:40:08,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702171874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:08,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:08,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932596746] [2025-03-04 14:40:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:08,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:08,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:08,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:08,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:08,294 INFO L87 Difference]: Start difference. First operand 298 states and 388 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:40:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:08,338 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2025-03-04 14:40:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:08,338 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:40:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:08,340 INFO L225 Difference]: With dead ends: 298 [2025-03-04 14:40:08,340 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 14:40:08,341 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:40:08,341 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:08,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 14:40:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2025-03-04 14:40:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 248 states have (on average 1.3790322580645162) internal successors, (342), 266 states have internal predecessors, (342), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 382 transitions. [2025-03-04 14:40:08,352 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 382 transitions. Word has length 49 [2025-03-04 14:40:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:08,352 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 382 transitions. [2025-03-04 14:40:08,352 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:40:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 382 transitions. [2025-03-04 14:40:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:08,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:08,354 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:08,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:40:08,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:08,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1211742527, now seen corresponding path program 1 times [2025-03-04 14:40:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:08,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448636637] [2025-03-04 14:40:08,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:08,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:08,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:08,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:09,023 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:40:09,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:09,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448636637] [2025-03-04 14:40:09,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448636637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:09,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:09,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101342202] [2025-03-04 14:40:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:09,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:09,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:09,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:09,024 INFO L87 Difference]: Start difference. First operand 293 states and 382 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:10,258 INFO L93 Difference]: Finished difference Result 798 states and 1074 transitions. [2025-03-04 14:40:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:40:10,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-04 14:40:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:10,262 INFO L225 Difference]: With dead ends: 798 [2025-03-04 14:40:10,262 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 14:40:10,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:10,264 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 543 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:10,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 937 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 14:40:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 14:40:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 389. [2025-03-04 14:40:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 337 states have (on average 1.4124629080118694) internal successors, (476), 357 states have internal predecessors, (476), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2025-03-04 14:40:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 525 transitions. [2025-03-04 14:40:10,280 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 525 transitions. Word has length 55 [2025-03-04 14:40:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:10,280 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 525 transitions. [2025-03-04 14:40:10,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 525 transitions. [2025-03-04 14:40:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:10,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:10,282 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:10,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:40:10,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:10,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1275770306, now seen corresponding path program 1 times [2025-03-04 14:40:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:10,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566042768] [2025-03-04 14:40:10,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:10,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:10,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:10,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:10,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:11,135 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:40:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:11,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566042768] [2025-03-04 14:40:11,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566042768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:11,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:11,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:11,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202961466] [2025-03-04 14:40:11,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:11,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:11,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:11,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:11,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:11,137 INFO L87 Difference]: Start difference. First operand 389 states and 525 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:11,584 INFO L93 Difference]: Finished difference Result 506 states and 699 transitions. [2025-03-04 14:40:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:40:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-04 14:40:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:11,587 INFO L225 Difference]: With dead ends: 506 [2025-03-04 14:40:11,587 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 14:40:11,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:40:11,587 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 108 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:11,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1574 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:40:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 14:40:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 488. [2025-03-04 14:40:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 430 states have (on average 1.4348837209302325) internal successors, (617), 452 states have internal predecessors, (617), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 679 transitions. [2025-03-04 14:40:11,606 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 679 transitions. Word has length 55 [2025-03-04 14:40:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:11,606 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 679 transitions. [2025-03-04 14:40:11,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 679 transitions. [2025-03-04 14:40:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:11,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:11,607 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:11,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:40:11,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2131693309, now seen corresponding path program 1 times [2025-03-04 14:40:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401261582] [2025-03-04 14:40:11,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:12,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:12,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:12,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:12,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:12,531 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:40:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401261582] [2025-03-04 14:40:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401261582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:12,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:40:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229974010] [2025-03-04 14:40:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:12,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:12,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:12,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:12,532 INFO L87 Difference]: Start difference. First operand 488 states and 679 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:12,820 INFO L93 Difference]: Finished difference Result 922 states and 1298 transitions. [2025-03-04 14:40:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2025-03-04 14:40:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:12,823 INFO L225 Difference]: With dead ends: 922 [2025-03-04 14:40:12,823 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 14:40:12,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:12,824 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 211 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:12,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1303 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 14:40:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-04 14:40:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 430 states have (on average 1.4325581395348836) internal successors, (616), 452 states have internal predecessors, (616), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 678 transitions. [2025-03-04 14:40:12,837 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 678 transitions. Word has length 55 [2025-03-04 14:40:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:12,837 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 678 transitions. [2025-03-04 14:40:12,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 678 transitions. [2025-03-04 14:40:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:12,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:12,838 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:40:12,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 14:40:12,838 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:12,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1331281127, now seen corresponding path program 1 times [2025-03-04 14:40:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219516284] [2025-03-04 14:40:12,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:13,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:13,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:13,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:13,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:13,493 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:40:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219516284] [2025-03-04 14:40:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219516284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86511474] [2025-03-04 14:40:13,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:13,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:13,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:13,495 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:40:13,497 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:40:14,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:14,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:14,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:14,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:14,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:14,643 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:40:14,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:14,730 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:40:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86511474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:14,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:14,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:40:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496183267] [2025-03-04 14:40:14,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:14,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:14,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:14,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:14,731 INFO L87 Difference]: Start difference. First operand 488 states and 678 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:40:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:14,835 INFO L93 Difference]: Finished difference Result 951 states and 1334 transitions. [2025-03-04 14:40:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:14,836 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:40:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:14,838 INFO L225 Difference]: With dead ends: 951 [2025-03-04 14:40:14,838 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 14:40:14,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:14,839 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:14,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1014 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 14:40:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-04 14:40:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 448 states have (on average 1.4151785714285714) internal successors, (634), 470 states have internal predecessors, (634), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 696 transitions. [2025-03-04 14:40:14,855 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 696 transitions. Word has length 55 [2025-03-04 14:40:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:14,856 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 696 transitions. [2025-03-04 14:40:14,856 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:40:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 696 transitions. [2025-03-04 14:40:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 14:40:14,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:14,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:14,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:15,061 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,SelfDestructingSolverStorable13 [2025-03-04 14:40:15,062 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:15,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1093656651, now seen corresponding path program 1 times [2025-03-04 14:40:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283233578] [2025-03-04 14:40:15,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:15,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 14:40:15,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 14:40:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:15,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283233578] [2025-03-04 14:40:15,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283233578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741316507] [2025-03-04 14:40:15,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:15,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:15,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:15,988 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:40:15,990 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:40:16,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 14:40:17,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 14:40:17,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:17,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:17,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:17,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:17,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741316507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:17,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:17,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 14:40:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468287649] [2025-03-04 14:40:17,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:17,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:40:17,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:17,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:40:17,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:40:17,471 INFO L87 Difference]: Start difference. First operand 506 states and 696 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:17,629 INFO L93 Difference]: Finished difference Result 996 states and 1385 transitions. [2025-03-04 14:40:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:40:17,630 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2025-03-04 14:40:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:17,633 INFO L225 Difference]: With dead ends: 996 [2025-03-04 14:40:17,633 INFO L226 Difference]: Without dead ends: 542 [2025-03-04 14:40:17,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:40:17,636 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:17,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 677 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-04 14:40:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-04 14:40:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 484 states have (on average 1.384297520661157) internal successors, (670), 506 states have internal predecessors, (670), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 732 transitions. [2025-03-04 14:40:17,654 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 732 transitions. Word has length 71 [2025-03-04 14:40:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:17,654 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 732 transitions. [2025-03-04 14:40:17,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 732 transitions. [2025-03-04 14:40:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 14:40:17,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:17,655 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:17,668 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:40:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 14:40:17,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -74286645, now seen corresponding path program 2 times [2025-03-04 14:40:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624541345] [2025-03-04 14:40:17,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:18,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 14:40:18,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 89 statements. [2025-03-04 14:40:18,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:40:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624541345] [2025-03-04 14:40:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624541345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:40:18,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674288909] [2025-03-04 14:40:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:18,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:40:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:18,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:40:18,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:40:18,918 INFO L87 Difference]: Start difference. First operand 542 states and 732 transitions. Second operand has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:20,645 INFO L93 Difference]: Finished difference Result 807 states and 1102 transitions. [2025-03-04 14:40:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:40:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2025-03-04 14:40:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:20,649 INFO L225 Difference]: With dead ends: 807 [2025-03-04 14:40:20,649 INFO L226 Difference]: Without dead ends: 806 [2025-03-04 14:40:20,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:40:20,650 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 867 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:20,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1259 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 14:40:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-04 14:40:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 729. [2025-03-04 14:40:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 650 states have (on average 1.4) internal successors, (910), 673 states have internal predecessors, (910), 43 states have call successors, (43), 20 states have call predecessors, (43), 23 states have return successors, (50), 37 states have call predecessors, (50), 37 states have call successors, (50) [2025-03-04 14:40:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1003 transitions. [2025-03-04 14:40:20,673 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1003 transitions. Word has length 89 [2025-03-04 14:40:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:20,673 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1003 transitions. [2025-03-04 14:40:20,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1003 transitions. [2025-03-04 14:40:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 14:40:20,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:20,676 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:20,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:40:20,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:20,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash 249271598, now seen corresponding path program 1 times [2025-03-04 14:40:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359112376] [2025-03-04 14:40:20,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:21,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 14:40:21,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 14:40:21,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:21,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:40:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359112376] [2025-03-04 14:40:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359112376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615566744] [2025-03-04 14:40:22,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:22,183 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:40:22,185 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:40:23,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 14:40:23,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 14:40:23,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:23,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:23,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 14:40:23,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:40:24,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:40:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615566744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:24,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:24,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 14:40:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662370576] [2025-03-04 14:40:24,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:24,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 14:40:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:24,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 14:40:24,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-03-04 14:40:24,914 INFO L87 Difference]: Start difference. First operand 729 states and 1003 transitions. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 14:40:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:29,248 INFO L93 Difference]: Finished difference Result 1354 states and 1861 transitions. [2025-03-04 14:40:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 14:40:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 90 [2025-03-04 14:40:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:29,251 INFO L225 Difference]: With dead ends: 1354 [2025-03-04 14:40:29,251 INFO L226 Difference]: Without dead ends: 737 [2025-03-04 14:40:29,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 14:40:29,252 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1334 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:29,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 3270 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-04 14:40:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-04 14:40:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 707. [2025-03-04 14:40:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 625 states have (on average 1.3552) internal successors, (847), 650 states have internal predecessors, (847), 47 states have call successors, (47), 23 states have call predecessors, (47), 24 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2025-03-04 14:40:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 935 transitions. [2025-03-04 14:40:29,273 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 935 transitions. Word has length 90 [2025-03-04 14:40:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:29,274 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 935 transitions. [2025-03-04 14:40:29,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 14:40:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 935 transitions. [2025-03-04 14:40:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:40:29,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:29,275 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:29,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:29,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:29,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:29,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash -877303811, now seen corresponding path program 1 times [2025-03-04 14:40:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:29,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158928510] [2025-03-04 14:40:29,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:29,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:29,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:40:30,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:40:30,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:30,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-04 14:40:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158928510] [2025-03-04 14:40:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158928510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182459805] [2025-03-04 14:40:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:30,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:30,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:30,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:40:30,355 INFO L87 Difference]: Start difference. First operand 707 states and 935 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:30,693 INFO L93 Difference]: Finished difference Result 1010 states and 1344 transitions. [2025-03-04 14:40:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 14:40:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:30,697 INFO L225 Difference]: With dead ends: 1010 [2025-03-04 14:40:30,697 INFO L226 Difference]: Without dead ends: 1008 [2025-03-04 14:40:30,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:40:30,697 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 870 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:30,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 887 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-04 14:40:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 827. [2025-03-04 14:40:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 764 states have internal predecessors, (1015), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-03-04 14:40:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1114 transitions. [2025-03-04 14:40:30,722 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1114 transitions. Word has length 101 [2025-03-04 14:40:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:30,723 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1114 transitions. [2025-03-04 14:40:30,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1114 transitions. [2025-03-04 14:40:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:40:30,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:30,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:30,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:40:30,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1061703267, now seen corresponding path program 1 times [2025-03-04 14:40:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980287983] [2025-03-04 14:40:30,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:31,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:40:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:40:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:31,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:31,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980287983] [2025-03-04 14:40:31,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980287983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:31,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:31,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813256320] [2025-03-04 14:40:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:31,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:31,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:31,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:31,603 INFO L87 Difference]: Start difference. First operand 827 states and 1114 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:35,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:39,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:39,979 INFO L93 Difference]: Finished difference Result 949 states and 1312 transitions. [2025-03-04 14:40:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 14:40:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:39,983 INFO L225 Difference]: With dead ends: 949 [2025-03-04 14:40:39,983 INFO L226 Difference]: Without dead ends: 947 [2025-03-04 14:40:39,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:39,984 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 30 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:39,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1294 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-04 14:40:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-04 14:40:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 851. [2025-03-04 14:40:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 761 states have (on average 1.3731931668856767) internal successors, (1045), 788 states have internal predecessors, (1045), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-03-04 14:40:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1144 transitions. [2025-03-04 14:40:40,007 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1144 transitions. Word has length 101 [2025-03-04 14:40:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:40,007 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1144 transitions. [2025-03-04 14:40:40,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1144 transitions. [2025-03-04 14:40:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:40:40,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:40,008 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:40,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 14:40:40,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:40,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1061733058, now seen corresponding path program 1 times [2025-03-04 14:40:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:40,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252361517] [2025-03-04 14:40:40,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:40,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:40:40,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:40:40,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:40,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:40,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252361517] [2025-03-04 14:40:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252361517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:40,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:40,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:40,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26524990] [2025-03-04 14:40:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:40,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:40,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:40,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:40,773 INFO L87 Difference]: Start difference. First operand 851 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:40,887 INFO L93 Difference]: Finished difference Result 1526 states and 2086 transitions. [2025-03-04 14:40:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 14:40:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:40,891 INFO L225 Difference]: With dead ends: 1526 [2025-03-04 14:40:40,892 INFO L226 Difference]: Without dead ends: 827 [2025-03-04 14:40:40,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:40,894 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 0 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:40,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1339 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-04 14:40:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 823. [2025-03-04 14:40:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 730 states have (on average 1.358904109589041) internal successors, (992), 757 states have internal predecessors, (992), 50 states have call successors, (50), 26 states have call predecessors, (50), 32 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-03-04 14:40:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1096 transitions. [2025-03-04 14:40:40,922 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1096 transitions. Word has length 101 [2025-03-04 14:40:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:40,923 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1096 transitions. [2025-03-04 14:40:40,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1096 transitions. [2025-03-04 14:40:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:40:40,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:40,924 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:40,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:40:40,924 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:40,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1930487274, now seen corresponding path program 1 times [2025-03-04 14:40:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559623544] [2025-03-04 14:40:40,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:41,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:40:41,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:40:41,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:41,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:41,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559623544] [2025-03-04 14:40:41,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559623544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:41,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:41,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:41,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835279595] [2025-03-04 14:40:41,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:41,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:41,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:41,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:41,762 INFO L87 Difference]: Start difference. First operand 823 states and 1096 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:41,883 INFO L93 Difference]: Finished difference Result 834 states and 1106 transitions. [2025-03-04 14:40:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:41,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-04 14:40:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:41,887 INFO L225 Difference]: With dead ends: 834 [2025-03-04 14:40:41,888 INFO L226 Difference]: Without dead ends: 831 [2025-03-04 14:40:41,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:41,890 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 13 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:41,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1339 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-04 14:40:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 828. [2025-03-04 14:40:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 734 states have (on average 1.3583106267029972) internal successors, (997), 761 states have internal predecessors, (997), 50 states have call successors, (50), 27 states have call predecessors, (50), 33 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-03-04 14:40:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1101 transitions. [2025-03-04 14:40:41,926 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1101 transitions. Word has length 102 [2025-03-04 14:40:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:41,927 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1101 transitions. [2025-03-04 14:40:41,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1101 transitions. [2025-03-04 14:40:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:40:41,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:41,928 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:41,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:40:41,928 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:41,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:41,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1930486313, now seen corresponding path program 1 times [2025-03-04 14:40:41,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:41,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542057043] [2025-03-04 14:40:41,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:42,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:40:42,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:40:42,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:42,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542057043] [2025-03-04 14:40:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542057043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083938262] [2025-03-04 14:40:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:42,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:42,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:42,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:40:42,787 INFO L87 Difference]: Start difference. First operand 828 states and 1101 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:42,963 INFO L93 Difference]: Finished difference Result 1544 states and 2124 transitions. [2025-03-04 14:40:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-03-04 14:40:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:42,971 INFO L225 Difference]: With dead ends: 1544 [2025-03-04 14:40:42,971 INFO L226 Difference]: Without dead ends: 1241 [2025-03-04 14:40:42,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:42,980 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 174 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:42,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1070 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-04 14:40:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1064. [2025-03-04 14:40:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 965 states have (on average 1.3937823834196892) internal successors, (1345), 989 states have internal predecessors, (1345), 55 states have call successors, (55), 27 states have call predecessors, (55), 33 states have return successors, (75), 49 states have call predecessors, (75), 43 states have call successors, (75) [2025-03-04 14:40:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1475 transitions. [2025-03-04 14:40:43,020 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1475 transitions. Word has length 102 [2025-03-04 14:40:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:43,022 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1475 transitions. [2025-03-04 14:40:43,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1475 transitions. [2025-03-04 14:40:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:40:43,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:43,023 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:43,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 14:40:43,023 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:43,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1758958370, now seen corresponding path program 1 times [2025-03-04 14:40:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:43,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549267858] [2025-03-04 14:40:43,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:43,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:40:43,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:40:43,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:44,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549267858] [2025-03-04 14:40:44,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549267858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:44,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:44,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752072175] [2025-03-04 14:40:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:44,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:44,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:44,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:44,020 INFO L87 Difference]: Start difference. First operand 1064 states and 1475 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:40:48,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:52,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:52,790 INFO L93 Difference]: Finished difference Result 1539 states and 2126 transitions. [2025-03-04 14:40:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 103 [2025-03-04 14:40:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:52,795 INFO L225 Difference]: With dead ends: 1539 [2025-03-04 14:40:52,795 INFO L226 Difference]: Without dead ends: 1253 [2025-03-04 14:40:52,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:52,800 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 449 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:52,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1086 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-03-04 14:40:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-04 14:40:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1092. [2025-03-04 14:40:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 991 states have (on average 1.3915237134207872) internal successors, (1379), 1015 states have internal predecessors, (1379), 57 states have call successors, (57), 27 states have call predecessors, (57), 33 states have return successors, (77), 51 states have call predecessors, (77), 45 states have call successors, (77) [2025-03-04 14:40:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1513 transitions. [2025-03-04 14:40:52,847 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1513 transitions. Word has length 103 [2025-03-04 14:40:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:52,848 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1513 transitions. [2025-03-04 14:40:52,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:40:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1513 transitions. [2025-03-04 14:40:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:40:52,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:52,849 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:52,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 14:40:52,849 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-04 14:40:52,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2052361377, now seen corresponding path program 1 times [2025-03-04 14:40:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117159605] [2025-03-04 14:40:52,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:53,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:40:53,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:40:53,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:53,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:55,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117159605] [2025-03-04 14:40:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117159605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:55,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 14:40:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536355727] [2025-03-04 14:40:55,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:40:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:55,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:40:55,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:40:55,384 INFO L87 Difference]: Start difference. First operand 1092 states and 1513 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:59,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:41:03,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:41:07,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:41:11,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []