./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/tac-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/tac-2.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 27f5f348d88bd7c6c0940cfd5790bada57c9cd6c65410c9bbddbe9e7000f4afc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:42:49,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:42:49,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:42:49,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:42:49,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:42:49,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:42:49,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:42:49,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:42:49,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:42:49,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:42:49,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:42:49,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:42:49,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:42:49,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:42:49,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:42:49,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:42:49,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:42:49,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:42:49,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:42:49,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:42:49,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:42:49,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:42:49,160 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 -> 27f5f348d88bd7c6c0940cfd5790bada57c9cd6c65410c9bbddbe9e7000f4afc [2025-03-04 14:42:49,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:42:49,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:42:49,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:42:49,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:42:49,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:42:49,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/tac-2.i [2025-03-04 14:42:50,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca169e32e/2be2c376b7254538b4a25ec237d0a6e3/FLAG9269299ef [2025-03-04 14:42:50,904 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:42:50,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/tac-2.i [2025-03-04 14:42:50,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca169e32e/2be2c376b7254538b4a25ec237d0a6e3/FLAG9269299ef [2025-03-04 14:42:50,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca169e32e/2be2c376b7254538b4a25ec237d0a6e3 [2025-03-04 14:42:50,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:42:50,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:42:50,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:42:50,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:42:50,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:42:50,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:42:50" (1/1) ... [2025-03-04 14:42:50,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67366e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:50, skipping insertion in model container [2025-03-04 14:42:50,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:42:50" (1/1) ... [2025-03-04 14:42:51,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:42:51,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:42:51,840 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:42:51,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:42:52,067 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:42:52,074 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:42:52,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52 WrapperNode [2025-03-04 14:42:52,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:42:52,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:42:52,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:42:52,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:42:52,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,180 INFO L138 Inliner]: procedures = 575, calls = 742, calls flagged for inlining = 26, calls inlined = 25, statements flattened = 1959 [2025-03-04 14:42:52,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:42:52,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:42:52,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:42:52,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:42:52,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,279 INFO L175 MemorySlicer]: Split 629 memory accesses to 19 slices as follows [2, 2, 3, 79, 19, 3, 3, 2, 34, 3, 44, 12, 15, 17, 355, 3, 7, 6, 20]. 56 percent of accesses are in the largest equivalence class. The 381 initializations are split as follows [0, 2, 0, 4, 0, 0, 3, 2, 5, 0, 0, 1, 0, 4, 355, 0, 1, 0, 4]. The 101 writes are split as follows [1, 0, 0, 51, 4, 0, 0, 0, 0, 0, 12, 5, 1, 4, 0, 0, 2, 6, 15]. [2025-03-04 14:42:52,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:42:52,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:42:52,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:42:52,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:42:52,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (1/1) ... [2025-03-04 14:42:52,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:42:52,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:52,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:42:52,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 14:42:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 14:42:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 14:42:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 14:42:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 14:42:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 14:42:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 14:42:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 14:42:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 14:42:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 14:42:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 14:42:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 14:42:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 14:42:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 14:42:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 14:42:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 14:42:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 14:42:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 14:42:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 14:42:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 14:42:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 14:42:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 14:42:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 14:42:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 14:42:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-04 14:42:52,494 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 14:42:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 14:42:52,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:42:52,496 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 14:42:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:42:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:42:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:42:52,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:42:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:42:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:42:52,500 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:42:52,500 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:42:52,500 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:42:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:42:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 14:42:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 14:42:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 14:42:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 14:42:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 14:42:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 14:42:52,503 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:42:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 14:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 14:42:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:42:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:42:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 14:42:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-03-04 14:42:52,507 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:42:52,507 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 14:42:52,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 14:42:52,982 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:42:52,985 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:42:57,615 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3052: havoc _IO_getc_#t~nondet237#1; [2025-03-04 14:42:57,615 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-04 14:42:57,615 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3103: havoc getopt_long_#t~ret266#1; [2025-03-04 14:42:57,615 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: call ULTIMATE.dealloc(__main_~#list~0#1.base, __main_~#list~0#1.offset);havoc __main_~#list~0#1.base, __main_~#list~0#1.offset; [2025-03-04 14:42:57,831 INFO L? ?]: Removed 809 outVars from TransFormulas that were not future-live. [2025-03-04 14:42:57,831 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:42:57,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:42:57,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:42:57,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:57 BoogieIcfgContainer [2025-03-04 14:42:57,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:42:57,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:42:57,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:42:57,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:42:57,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:42:50" (1/3) ... [2025-03-04 14:42:57,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17509521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:57, skipping insertion in model container [2025-03-04 14:42:57,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:42:52" (2/3) ... [2025-03-04 14:42:57,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17509521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:57, skipping insertion in model container [2025-03-04 14:42:57,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:57" (3/3) ... [2025-03-04 14:42:57,874 INFO L128 eAbstractionObserver]: Analyzing ICFG tac-2.i [2025-03-04 14:42:57,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:42:57,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tac-2.i that has 65 procedures, 768 locations, 1 initial locations, 69 loop locations, and 72 error locations. [2025-03-04 14:42:57,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:42:57,957 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;@475645af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:42:57,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-04 14:42:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 560 states, 446 states have (on average 1.647982062780269) internal successors, (735), 522 states have internal predecessors, (735), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 14:42:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:42:57,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:57,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:42:57,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:42:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 37401535, now seen corresponding path program 1 times [2025-03-04 14:42:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768728001] [2025-03-04 14:42:57,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:42:58,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:42:58,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:58,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768728001] [2025-03-04 14:42:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768728001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406383180] [2025-03-04 14:42:58,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:58,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:58,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:42:58,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:58,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:58,745 INFO L87 Difference]: Start difference. First operand has 560 states, 446 states have (on average 1.647982062780269) internal successors, (735), 522 states have internal predecessors, (735), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:58,914 INFO L93 Difference]: Finished difference Result 1032 states and 1496 transitions. [2025-03-04 14:42:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:42:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:58,924 INFO L225 Difference]: With dead ends: 1032 [2025-03-04 14:42:58,925 INFO L226 Difference]: Without dead ends: 473 [2025-03-04 14:42:58,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:58,935 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:58,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1255 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:42:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-04 14:42:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-03-04 14:42:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 391 states have (on average 1.5626598465473145) internal successors, (611), 444 states have internal predecessors, (611), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:42:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 652 transitions. [2025-03-04 14:42:58,996 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 652 transitions. Word has length 4 [2025-03-04 14:42:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:58,996 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 652 transitions. [2025-03-04 14:42:58,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 652 transitions. [2025-03-04 14:42:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:42:58,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:58,998 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:42:58,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:42:58,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:42:58,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1833740604, now seen corresponding path program 1 times [2025-03-04 14:42:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:42:59,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380211888] [2025-03-04 14:42:59,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:59,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:42:59,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:42:59,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:42:59,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:59,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:59,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:42:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380211888] [2025-03-04 14:42:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380211888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:42:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364986848] [2025-03-04 14:42:59,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:59,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:59,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:59,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:59,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:42:59,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:42:59,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:42:59,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:59,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:59,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:00,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:00,027 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:43:00,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:43:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364986848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:00,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:43:00,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:43:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889023859] [2025-03-04 14:43:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:00,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:43:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:00,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:43:00,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:00,030 INFO L87 Difference]: Start difference. First operand 473 states and 652 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:43:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:00,129 INFO L93 Difference]: Finished difference Result 473 states and 652 transitions. [2025-03-04 14:43:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:43:00,131 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:43:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:00,133 INFO L225 Difference]: With dead ends: 473 [2025-03-04 14:43:00,133 INFO L226 Difference]: Without dead ends: 472 [2025-03-04 14:43:00,133 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:43:00,133 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:00,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1245 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-04 14:43:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-04 14:43:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 391 states have (on average 1.5601023017902813) internal successors, (610), 443 states have internal predecessors, (610), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 651 transitions. [2025-03-04 14:43:00,164 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 651 transitions. Word has length 7 [2025-03-04 14:43:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:00,164 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 651 transitions. [2025-03-04 14:43:00,164 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:43:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 651 transitions. [2025-03-04 14:43:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:43:00,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:00,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:43:00,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:43:00,365 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:43:00,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:00,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1011385025, now seen corresponding path program 1 times [2025-03-04 14:43:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360828512] [2025-03-04 14:43:00,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:00,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:43:00,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:43:00,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:00,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:00,658 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:43:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360828512] [2025-03-04 14:43:00,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360828512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:00,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:00,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584795691] [2025-03-04 14:43:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:00,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:00,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:00,659 INFO L87 Difference]: Start difference. First operand 472 states and 651 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:43:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:00,731 INFO L93 Difference]: Finished difference Result 472 states and 651 transitions. [2025-03-04 14:43:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:00,732 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:43:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:00,735 INFO L225 Difference]: With dead ends: 472 [2025-03-04 14:43:00,736 INFO L226 Difference]: Without dead ends: 471 [2025-03-04 14:43:00,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:00,737 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 0 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:00,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1246 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-04 14:43:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2025-03-04 14:43:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 389 states have (on average 1.5604113110539846) internal successors, (607), 440 states have internal predecessors, (607), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 648 transitions. [2025-03-04 14:43:00,760 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 648 transitions. Word has length 8 [2025-03-04 14:43:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:00,760 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 648 transitions. [2025-03-04 14:43:00,760 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:43:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 648 transitions. [2025-03-04 14:43:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:43:00,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:00,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:00,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:43:00,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash 743675156, now seen corresponding path program 1 times [2025-03-04 14:43:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058727923] [2025-03-04 14:43:00,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:00,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:43:00,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:43:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:00,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:01,113 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:43:01,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:01,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058727923] [2025-03-04 14:43:01,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058727923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:01,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181250335] [2025-03-04 14:43:01,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:01,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:01,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:01,116 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:43:01,118 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:43:01,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:43:01,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:43:01,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:01,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:01,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:43:01,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:01,675 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:43:01,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:43:01,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181250335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:01,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:43:01,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:43:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630679716] [2025-03-04 14:43:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:01,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:01,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:01,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:01,677 INFO L87 Difference]: Start difference. First operand 469 states and 648 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:01,750 INFO L93 Difference]: Finished difference Result 469 states and 648 transitions. [2025-03-04 14:43:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:01,751 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:43:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:01,753 INFO L225 Difference]: With dead ends: 469 [2025-03-04 14:43:01,754 INFO L226 Difference]: Without dead ends: 467 [2025-03-04 14:43:01,755 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:43:01,755 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 519 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:01,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 724 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-04 14:43:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-04 14:43:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 389 states have (on average 1.5552699228791773) internal successors, (605), 438 states have internal predecessors, (605), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 646 transitions. [2025-03-04 14:43:01,773 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 646 transitions. Word has length 12 [2025-03-04 14:43:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:01,773 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 646 transitions. [2025-03-04 14:43:01,774 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:43:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 646 transitions. [2025-03-04 14:43:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:43:01,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:01,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:01,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:43:01,976 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:43:01,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:01,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1579094499, now seen corresponding path program 1 times [2025-03-04 14:43:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840074962] [2025-03-04 14:43:01,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:02,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:43:02,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:43:02,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:02,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:02,276 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:43:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840074962] [2025-03-04 14:43:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840074962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109048075] [2025-03-04 14:43:02,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:02,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:02,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:02,279 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:43:02,281 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:43:02,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:43:02,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:43:02,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:02,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:02,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:02,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:02,834 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:43:02,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:02,871 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:43:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109048075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:02,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:43:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374868620] [2025-03-04 14:43:02,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:02,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:02,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:02,872 INFO L87 Difference]: Start difference. First operand 467 states and 646 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:43:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:02,991 INFO L93 Difference]: Finished difference Result 937 states and 1297 transitions. [2025-03-04 14:43:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:02,992 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:43:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:02,994 INFO L225 Difference]: With dead ends: 937 [2025-03-04 14:43:02,995 INFO L226 Difference]: Without dead ends: 476 [2025-03-04 14:43:02,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:02,996 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 4 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:02,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2482 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-04 14:43:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2025-03-04 14:43:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 398 states have (on average 1.5427135678391959) internal successors, (614), 447 states have internal predecessors, (614), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 655 transitions. [2025-03-04 14:43:03,015 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 655 transitions. Word has length 13 [2025-03-04 14:43:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:03,015 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 655 transitions. [2025-03-04 14:43:03,015 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:43:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 655 transitions. [2025-03-04 14:43:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:43:03,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:03,015 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:03,025 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:43:03,216 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:43:03,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:03,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1248877542, now seen corresponding path program 2 times [2025-03-04 14:43:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358960588] [2025-03-04 14:43:03,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:03,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:43:03,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:43:03,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:43:03,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:03,646 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:43:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358960588] [2025-03-04 14:43:03,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358960588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:03,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:03,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:43:03,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202398720] [2025-03-04 14:43:03,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:03,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:43:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:03,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:43:03,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:03,648 INFO L87 Difference]: Start difference. First operand 476 states and 655 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:03,774 INFO L93 Difference]: Finished difference Result 476 states and 655 transitions. [2025-03-04 14:43:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:43:03,775 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:43:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:03,778 INFO L225 Difference]: With dead ends: 476 [2025-03-04 14:43:03,778 INFO L226 Difference]: Without dead ends: 474 [2025-03-04 14:43:03,778 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:43:03,779 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 518 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:03,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1933 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-04 14:43:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2025-03-04 14:43:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 398 states have (on average 1.5376884422110553) internal successors, (612), 445 states have internal predecessors, (612), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 653 transitions. [2025-03-04 14:43:03,795 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 653 transitions. Word has length 22 [2025-03-04 14:43:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:03,795 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 653 transitions. [2025-03-04 14:43:03,795 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:43:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 653 transitions. [2025-03-04 14:43:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:43:03,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:03,796 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:43:03,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:43:03,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -839850516, now seen corresponding path program 1 times [2025-03-04 14:43:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751772176] [2025-03-04 14:43:03,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:03,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:43:03,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:43:03,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:03,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:04,102 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:43:04,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:04,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751772176] [2025-03-04 14:43:04,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751772176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:04,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:43:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158858382] [2025-03-04 14:43:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:04,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:04,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:04,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:04,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:04,105 INFO L87 Difference]: Start difference. First operand 474 states and 653 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:04,183 INFO L93 Difference]: Finished difference Result 931 states and 1290 transitions. [2025-03-04 14:43:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:04,183 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:43:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:04,185 INFO L225 Difference]: With dead ends: 931 [2025-03-04 14:43:04,185 INFO L226 Difference]: Without dead ends: 477 [2025-03-04 14:43:04,186 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:43:04,186 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 2 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:04,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1235 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-04 14:43:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-03-04 14:43:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 401 states have (on average 1.5336658354114714) internal successors, (615), 448 states have internal predecessors, (615), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 656 transitions. [2025-03-04 14:43:04,198 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 656 transitions. Word has length 27 [2025-03-04 14:43:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:04,199 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 656 transitions. [2025-03-04 14:43:04,199 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:43:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 656 transitions. [2025-03-04 14:43:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 14:43:04,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:04,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:04,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:43:04,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:04,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash -265895744, now seen corresponding path program 1 times [2025-03-04 14:43:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:04,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755542164] [2025-03-04 14:43:04,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:04,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:04,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 14:43:04,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 14:43:04,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:04,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:04,520 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:43:04,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:04,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755542164] [2025-03-04 14:43:04,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755542164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:04,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:04,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861903241] [2025-03-04 14:43:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:04,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:04,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:04,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:04,522 INFO L87 Difference]: Start difference. First operand 477 states and 656 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:04,619 INFO L93 Difference]: Finished difference Result 775 states and 1094 transitions. [2025-03-04 14:43:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 14:43:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:04,623 INFO L225 Difference]: With dead ends: 775 [2025-03-04 14:43:04,623 INFO L226 Difference]: Without dead ends: 773 [2025-03-04 14:43:04,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:04,623 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 412 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:04,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1222 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-04 14:43:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 481. [2025-03-04 14:43:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 405 states have (on average 1.5308641975308641) internal successors, (620), 452 states have internal predecessors, (620), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 661 transitions. [2025-03-04 14:43:04,640 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 661 transitions. Word has length 28 [2025-03-04 14:43:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:04,640 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 661 transitions. [2025-03-04 14:43:04,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 661 transitions. [2025-03-04 14:43:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:43:04,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:04,641 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:43:04,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:43:04,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:04,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1796331361, now seen corresponding path program 1 times [2025-03-04 14:43:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360024976] [2025-03-04 14:43:04,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:04,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:43:04,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:43:04,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:04,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:04,915 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:43:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360024976] [2025-03-04 14:43:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360024976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923406586] [2025-03-04 14:43:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:04,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:04,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:04,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:04,917 INFO L87 Difference]: Start difference. First operand 481 states and 661 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:04,985 INFO L93 Difference]: Finished difference Result 494 states and 676 transitions. [2025-03-04 14:43:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:04,985 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:43:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:04,987 INFO L225 Difference]: With dead ends: 494 [2025-03-04 14:43:04,987 INFO L226 Difference]: Without dead ends: 492 [2025-03-04 14:43:04,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:04,988 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 3 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:04,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1232 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-04 14:43:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2025-03-04 14:43:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 414 states have (on average 1.5289855072463767) internal successors, (633), 461 states have internal predecessors, (633), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 674 transitions. [2025-03-04 14:43:04,999 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 674 transitions. Word has length 30 [2025-03-04 14:43:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:05,000 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 674 transitions. [2025-03-04 14:43:05,000 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:43:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 674 transitions. [2025-03-04 14:43:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:43:05,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:05,001 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:43:05,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:43:05,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:05,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1796331201, now seen corresponding path program 1 times [2025-03-04 14:43:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:05,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850605425] [2025-03-04 14:43:05,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:43:05,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:43:05,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:05,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:05,270 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:43:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850605425] [2025-03-04 14:43:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850605425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608443133] [2025-03-04 14:43:05,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:05,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:05,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:05,272 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:43:05,274 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:43:05,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:43:05,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:43:05,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:05,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:05,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:43:05,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:05,954 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:43:05,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:06,035 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:43:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608443133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:06,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:43:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380335761] [2025-03-04 14:43:06,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:06,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:43:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:06,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:43:06,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:43:06,037 INFO L87 Difference]: Start difference. First operand 490 states and 674 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:43:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:06,219 INFO L93 Difference]: Finished difference Result 982 states and 1356 transitions. [2025-03-04 14:43:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:43:06,219 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:43:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:06,221 INFO L225 Difference]: With dead ends: 982 [2025-03-04 14:43:06,221 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 14:43:06,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:43:06,223 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 5 mSDsluCounter, 3060 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:06,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3674 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 14:43:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-04 14:43:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 432 states have (on average 1.5023148148148149) internal successors, (649), 478 states have internal predecessors, (649), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 690 transitions. [2025-03-04 14:43:06,235 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 690 transitions. Word has length 30 [2025-03-04 14:43:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:06,235 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 690 transitions. [2025-03-04 14:43:06,235 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:43:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 690 transitions. [2025-03-04 14:43:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:43:06,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:06,237 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:43:06,248 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:43:06,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:06,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:06,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1278443922, now seen corresponding path program 1 times [2025-03-04 14:43:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905584814] [2025-03-04 14:43:06,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:06,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:43:06,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:43:06,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:06,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:06,782 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:43:06,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905584814] [2025-03-04 14:43:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905584814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:06,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494280999] [2025-03-04 14:43:06,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:06,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:06,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:06,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:06,785 INFO L87 Difference]: Start difference. First operand 507 states and 690 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:06,838 INFO L93 Difference]: Finished difference Result 507 states and 690 transitions. [2025-03-04 14:43:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:06,839 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:43:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:06,841 INFO L225 Difference]: With dead ends: 507 [2025-03-04 14:43:06,841 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 14:43:06,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:06,842 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:06,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1233 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:43:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 14:43:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 502. [2025-03-04 14:43:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 428 states have (on average 1.5023364485981308) internal successors, (643), 473 states have internal predecessors, (643), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2025-03-04 14:43:06,857 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 49 [2025-03-04 14:43:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:06,857 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2025-03-04 14:43:06,857 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:43:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2025-03-04 14:43:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:43:06,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:06,858 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:43:06,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1088419804, now seen corresponding path program 1 times [2025-03-04 14:43:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268833736] [2025-03-04 14:43:06,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:07,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:43:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:43:07,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268833736] [2025-03-04 14:43:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268833736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393761525] [2025-03-04 14:43:07,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:07,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:07,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:43:07,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:43:07,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:43:07,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:07,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:07,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:07,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:07,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:43:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393761525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:07,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:43:07,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:43:07,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152139354] [2025-03-04 14:43:07,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:07,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:43:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:07,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:43:07,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:07,827 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:07,969 INFO L93 Difference]: Finished difference Result 798 states and 1120 transitions. [2025-03-04 14:43:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:43:07,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-04 14:43:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:07,973 INFO L225 Difference]: With dead ends: 798 [2025-03-04 14:43:07,973 INFO L226 Difference]: Without dead ends: 797 [2025-03-04 14:43:07,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:07,974 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 823 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:07,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1849 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-04 14:43:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 501. [2025-03-04 14:43:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 428 states have (on average 1.5) internal successors, (642), 472 states have internal predecessors, (642), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 683 transitions. [2025-03-04 14:43:07,987 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 683 transitions. Word has length 50 [2025-03-04 14:43:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:07,987 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 683 transitions. [2025-03-04 14:43:07,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2025-03-04 14:43:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:43:07,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:07,988 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:07,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:43:08,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 14:43:08,188 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash 618725563, now seen corresponding path program 1 times [2025-03-04 14:43:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376057796] [2025-03-04 14:43:08,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:08,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:43:08,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:43:08,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:08,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376057796] [2025-03-04 14:43:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376057796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751328841] [2025-03-04 14:43:08,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:08,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:08,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:08,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:08,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:43:08,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:43:09,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:43:09,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:09,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:09,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:09,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:09,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:09,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751328841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:09,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:43:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858831605] [2025-03-04 14:43:09,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:09,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:09,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:09,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:09,172 INFO L87 Difference]: Start difference. First operand 501 states and 683 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:09,411 INFO L93 Difference]: Finished difference Result 1682 states and 2425 transitions. [2025-03-04 14:43:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-04 14:43:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:09,417 INFO L225 Difference]: With dead ends: 1682 [2025-03-04 14:43:09,417 INFO L226 Difference]: Without dead ends: 1681 [2025-03-04 14:43:09,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:09,418 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 2466 mSDsluCounter, 2266 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:09,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 2878 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:43:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-03-04 14:43:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 513. [2025-03-04 14:43:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 440 states have (on average 1.4931818181818182) internal successors, (657), 484 states have internal predecessors, (657), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 698 transitions. [2025-03-04 14:43:09,436 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 698 transitions. Word has length 51 [2025-03-04 14:43:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:09,437 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 698 transitions. [2025-03-04 14:43:09,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 698 transitions. [2025-03-04 14:43:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:43:09,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:09,437 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:09,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:43:09,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:09,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:09,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1740721436, now seen corresponding path program 1 times [2025-03-04 14:43:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204891233] [2025-03-04 14:43:09,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:09,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:43:09,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:43:09,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:09,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:43:09,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:09,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204891233] [2025-03-04 14:43:09,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204891233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:09,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63716678] [2025-03-04 14:43:09,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:09,921 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:09,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:43:10,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:43:10,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:43:10,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:10,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:10,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:10,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:43:10,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:43:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63716678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:10,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:10,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:43:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316764858] [2025-03-04 14:43:10,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:10,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:10,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:10,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:10,626 INFO L87 Difference]: Start difference. First operand 513 states and 698 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:10,705 INFO L93 Difference]: Finished difference Result 1001 states and 1373 transitions. [2025-03-04 14:43:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:10,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:43:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:10,708 INFO L225 Difference]: With dead ends: 1001 [2025-03-04 14:43:10,708 INFO L226 Difference]: Without dead ends: 531 [2025-03-04 14:43:10,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:10,710 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 4 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:10,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1845 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-04 14:43:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-04 14:43:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 458 states have (on average 1.4737991266375545) internal successors, (675), 502 states have internal predecessors, (675), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 716 transitions. [2025-03-04 14:43:10,725 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 716 transitions. Word has length 55 [2025-03-04 14:43:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:10,726 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 716 transitions. [2025-03-04 14:43:10,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 716 transitions. [2025-03-04 14:43:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:43:10,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:10,728 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:10,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:43:10,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:10,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:10,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2013478106, now seen corresponding path program 1 times [2025-03-04 14:43:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333375950] [2025-03-04 14:43:10,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:10,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:43:11,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:43:11,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:11,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:11,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333375950] [2025-03-04 14:43:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333375950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:11,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:43:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389547625] [2025-03-04 14:43:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:43:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:11,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:43:11,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:11,448 INFO L87 Difference]: Start difference. First operand 531 states and 716 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:15,466 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:43:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:15,709 INFO L93 Difference]: Finished difference Result 962 states and 1319 transitions. [2025-03-04 14:43:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:43:15,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-04 14:43:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:15,712 INFO L225 Difference]: With dead ends: 962 [2025-03-04 14:43:15,712 INFO L226 Difference]: Without dead ends: 532 [2025-03-04 14:43:15,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:43:15,713 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 1444 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:15,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 967 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 14:43:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-04 14:43:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 531. [2025-03-04 14:43:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 458 states have (on average 1.4694323144104804) internal successors, (673), 502 states have internal predecessors, (673), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 714 transitions. [2025-03-04 14:43:15,728 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 714 transitions. Word has length 60 [2025-03-04 14:43:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:15,729 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 714 transitions. [2025-03-04 14:43:15,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 714 transitions. [2025-03-04 14:43:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:43:15,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:15,730 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:15,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:43:15,730 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:15,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash -538678855, now seen corresponding path program 1 times [2025-03-04 14:43:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079444967] [2025-03-04 14:43:15,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:43:15,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:43:15,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:15,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:16,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:16,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079444967] [2025-03-04 14:43:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079444967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:16,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:16,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:16,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887781664] [2025-03-04 14:43:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:16,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:16,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:16,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:16,092 INFO L87 Difference]: Start difference. First operand 531 states and 714 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:16,237 INFO L93 Difference]: Finished difference Result 1053 states and 1451 transitions. [2025-03-04 14:43:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-04 14:43:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:16,240 INFO L225 Difference]: With dead ends: 1053 [2025-03-04 14:43:16,241 INFO L226 Difference]: Without dead ends: 626 [2025-03-04 14:43:16,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:16,242 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 118 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:16,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1177 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-04 14:43:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 573. [2025-03-04 14:43:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 499 states have (on average 1.4609218436873748) internal successors, (729), 543 states have internal predecessors, (729), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 772 transitions. [2025-03-04 14:43:16,258 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 772 transitions. Word has length 60 [2025-03-04 14:43:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:16,259 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 772 transitions. [2025-03-04 14:43:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:43:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 772 transitions. [2025-03-04 14:43:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:43:16,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:16,259 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:43:16,260 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:16,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2020698199, now seen corresponding path program 1 times [2025-03-04 14:43:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:16,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050453279] [2025-03-04 14:43:16,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:16,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:43:16,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:43:16,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:16,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:43:16,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050453279] [2025-03-04 14:43:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050453279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:16,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833759635] [2025-03-04 14:43:16,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:16,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:16,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:16,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:16,539 INFO L87 Difference]: Start difference. First operand 573 states and 772 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:43:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:16,606 INFO L93 Difference]: Finished difference Result 575 states and 772 transitions. [2025-03-04 14:43:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:16,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-03-04 14:43:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:16,608 INFO L225 Difference]: With dead ends: 575 [2025-03-04 14:43:16,608 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 14:43:16,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:16,609 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:16,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1227 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 14:43:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-03-04 14:43:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 499 states have (on average 1.4569138276553106) internal successors, (727), 543 states have internal predecessors, (727), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 770 transitions. [2025-03-04 14:43:16,625 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 770 transitions. Word has length 62 [2025-03-04 14:43:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:16,625 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 770 transitions. [2025-03-04 14:43:16,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:43:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 770 transitions. [2025-03-04 14:43:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 14:43:16,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:16,626 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:16,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 14:43:16,626 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:16,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash 533332463, now seen corresponding path program 2 times [2025-03-04 14:43:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625752615] [2025-03-04 14:43:16,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:16,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-04 14:43:16,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-04 14:43:16,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:43:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-04 14:43:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625752615] [2025-03-04 14:43:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625752615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:17,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:17,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:43:17,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394325347] [2025-03-04 14:43:17,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:17,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:43:17,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:17,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:43:17,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:43:17,017 INFO L87 Difference]: Start difference. First operand 573 states and 770 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:17,205 INFO L93 Difference]: Finished difference Result 1074 states and 1462 transitions. [2025-03-04 14:43:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-04 14:43:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:17,208 INFO L225 Difference]: With dead ends: 1074 [2025-03-04 14:43:17,208 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 14:43:17,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:43:17,209 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 523 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:17,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2391 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:43:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 14:43:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-03-04 14:43:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 499 states have (on average 1.4549098196392785) internal successors, (726), 543 states have internal predecessors, (726), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 769 transitions. [2025-03-04 14:43:17,227 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 769 transitions. Word has length 63 [2025-03-04 14:43:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:17,231 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 769 transitions. [2025-03-04 14:43:17,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:43:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 769 transitions. [2025-03-04 14:43:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:43:17,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:17,231 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:17,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:43:17,231 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:43:17,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -312677420, now seen corresponding path program 2 times [2025-03-04 14:43:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447541104] [2025-03-04 14:43:17,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:17,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:43:17,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:43:17,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:43:17,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 14:43:17,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447541104] [2025-03-04 14:43:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447541104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:17,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884026342] [2025-03-04 14:43:17,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:17,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:17,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:17,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:43:17,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:43:18,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:44:15,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:44:15,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:44:15,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:15,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:15,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:44:15,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:44:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884026342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:15,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:44:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513632146] [2025-03-04 14:44:15,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:15,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:44:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:15,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:44:15,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:44:15,595 INFO L87 Difference]: Start difference. First operand 573 states and 769 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:44:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:16,073 INFO L93 Difference]: Finished difference Result 1129 states and 1531 transitions. [2025-03-04 14:44:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 14:44:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 73 [2025-03-04 14:44:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:16,076 INFO L225 Difference]: With dead ends: 1129 [2025-03-04 14:44:16,076 INFO L226 Difference]: Without dead ends: 608 [2025-03-04 14:44:16,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 14:44:16,099 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 9 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:16,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2431 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-04 14:44:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2025-03-04 14:44:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 535 states have (on average 1.422429906542056) internal successors, (761), 578 states have internal predecessors, (761), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 804 transitions. [2025-03-04 14:44:16,119 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 804 transitions. Word has length 73 [2025-03-04 14:44:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:16,119 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 804 transitions. [2025-03-04 14:44:16,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:44:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 804 transitions. [2025-03-04 14:44:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 14:44:16,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:16,120 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:16,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:16,322 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:44:16,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1884591511, now seen corresponding path program 1 times [2025-03-04 14:44:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575180696] [2025-03-04 14:44:16,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:16,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:44:16,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:44:16,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:16,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575180696] [2025-03-04 14:44:16,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575180696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798574465] [2025-03-04 14:44:16,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:16,772 INFO L229 MonitoredProcess]: Starting monitored process 10 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:44:16,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:44:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:44:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:44:17,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:17,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:17,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 1946 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:17,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:17,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798574465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:17,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 14:44:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8081402] [2025-03-04 14:44:17,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:44:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:17,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:44:17,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:17,776 INFO L87 Difference]: Start difference. First operand 608 states and 804 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:44:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:18,312 INFO L93 Difference]: Finished difference Result 3973 states and 5690 transitions. [2025-03-04 14:44:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:44:18,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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 97 [2025-03-04 14:44:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:18,325 INFO L225 Difference]: With dead ends: 3973 [2025-03-04 14:44:18,325 INFO L226 Difference]: Without dead ends: 3972 [2025-03-04 14:44:18,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:18,329 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 6453 mSDsluCounter, 5797 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6523 SdHoareTripleChecker+Valid, 6406 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:18,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6523 Valid, 6406 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:44:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2025-03-04 14:44:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 632. [2025-03-04 14:44:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 559 states have (on average 1.4150268336314848) internal successors, (791), 602 states have internal predecessors, (791), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 834 transitions. [2025-03-04 14:44:18,368 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 834 transitions. Word has length 97 [2025-03-04 14:44:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:18,368 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 834 transitions. [2025-03-04 14:44:18,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:44:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 834 transitions. [2025-03-04 14:44:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:44:18,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:18,369 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:44:18,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 14:44:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:18,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:44:18,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 231882952, now seen corresponding path program 1 times [2025-03-04 14:44:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86964204] [2025-03-04 14:44:18,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:18,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:18,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:44:18,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:44:18,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:18,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:19,050 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:44:19,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86964204] [2025-03-04 14:44:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86964204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:19,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:44:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87261969] [2025-03-04 14:44:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:19,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:44:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:19,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:44:19,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:44:19,052 INFO L87 Difference]: Start difference. First operand 632 states and 834 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:44:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:19,239 INFO L93 Difference]: Finished difference Result 1218 states and 1683 transitions. [2025-03-04 14:44:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:44:19,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 102 [2025-03-04 14:44:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:19,242 INFO L225 Difference]: With dead ends: 1218 [2025-03-04 14:44:19,242 INFO L226 Difference]: Without dead ends: 851 [2025-03-04 14:44:19,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:44:19,244 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1223 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:19,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 1171 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-04 14:44:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 633. [2025-03-04 14:44:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 560 states have (on average 1.4142857142857144) internal successors, (792), 603 states have internal predecessors, (792), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 835 transitions. [2025-03-04 14:44:19,284 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 835 transitions. Word has length 102 [2025-03-04 14:44:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:19,284 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 835 transitions. [2025-03-04 14:44:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:44:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 835 transitions. [2025-03-04 14:44:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:44:19,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:19,285 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:44:19,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:44:19,285 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:44:19,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1119386633, now seen corresponding path program 1 times [2025-03-04 14:44:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:19,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471045877] [2025-03-04 14:44:19,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:44:19,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:44:19,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:19,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:19,561 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:44:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471045877] [2025-03-04 14:44:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471045877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201263700] [2025-03-04 14:44:19,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:19,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:19,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:19,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:19,563 INFO L87 Difference]: Start difference. First operand 633 states and 835 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:44:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:19,773 INFO L93 Difference]: Finished difference Result 1052 states and 1439 transitions. [2025-03-04 14:44:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 102 [2025-03-04 14:44:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:19,776 INFO L225 Difference]: With dead ends: 1052 [2025-03-04 14:44:19,777 INFO L226 Difference]: Without dead ends: 685 [2025-03-04 14:44:19,778 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:44:19,781 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 74 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:19,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1230 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-04 14:44:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 636. [2025-03-04 14:44:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 565 states have (on average 1.4088495575221238) internal successors, (796), 606 states have internal predecessors, (796), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 839 transitions. [2025-03-04 14:44:19,812 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 839 transitions. Word has length 102 [2025-03-04 14:44:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:19,812 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 839 transitions. [2025-03-04 14:44:19,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:44:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 839 transitions. [2025-03-04 14:44:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:44:19,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:19,814 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:44:19,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 14:44:19,815 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:44:19,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1123663308, now seen corresponding path program 1 times [2025-03-04 14:44:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681228741] [2025-03-04 14:44:19,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:20,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:44:20,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:44:20,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:20,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:20,217 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:44:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:20,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681228741] [2025-03-04 14:44:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681228741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:20,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:20,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:20,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217095191] [2025-03-04 14:44:20,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:20,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:20,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:20,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:20,219 INFO L87 Difference]: Start difference. First operand 636 states and 839 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:44:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:20,346 INFO L93 Difference]: Finished difference Result 690 states and 917 transitions. [2025-03-04 14:44:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:20,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 102 [2025-03-04 14:44:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:20,349 INFO L225 Difference]: With dead ends: 690 [2025-03-04 14:44:20,349 INFO L226 Difference]: Without dead ends: 687 [2025-03-04 14:44:20,349 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:44:20,350 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 187 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:20,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1024 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-04 14:44:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 633. [2025-03-04 14:44:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 565 states have (on average 1.4035398230088496) internal successors, (793), 603 states have internal predecessors, (793), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 836 transitions. [2025-03-04 14:44:20,393 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 836 transitions. Word has length 102 [2025-03-04 14:44:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:20,393 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 836 transitions. [2025-03-04 14:44:20,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:44:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 836 transitions. [2025-03-04 14:44:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:44:20,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:20,394 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:44:20,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 14:44:20,394 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:44:20,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash 341248112, now seen corresponding path program 1 times [2025-03-04 14:44:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501048349] [2025-03-04 14:44:20,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:20,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:44:20,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:44:20,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:20,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:20,651 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:44:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501048349] [2025-03-04 14:44:20,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501048349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:20,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:20,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463410264] [2025-03-04 14:44:20,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:20,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:20,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:20,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:20,652 INFO L87 Difference]: Start difference. First operand 633 states and 836 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:44:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:20,759 INFO L93 Difference]: Finished difference Result 1055 states and 1442 transitions. [2025-03-04 14:44:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:20,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:44:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:20,762 INFO L225 Difference]: With dead ends: 1055 [2025-03-04 14:44:20,762 INFO L226 Difference]: Without dead ends: 684 [2025-03-04 14:44:20,763 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:44:20,763 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 155 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:20,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1122 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-04 14:44:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 618. [2025-03-04 14:44:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 554 states have (on average 1.3953068592057762) internal successors, (773), 588 states have internal predecessors, (773), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 816 transitions. [2025-03-04 14:44:20,784 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 816 transitions. Word has length 103 [2025-03-04 14:44:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:20,784 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 816 transitions. [2025-03-04 14:44:20,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:44:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 816 transitions. [2025-03-04 14:44:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:44:20,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:20,785 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:44:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 14:44:20,785 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:44:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash 473825076, now seen corresponding path program 1 times [2025-03-04 14:44:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:20,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729919932] [2025-03-04 14:44:20,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:20,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:44:20,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:44:20,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:20,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:21,090 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:44:21,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:21,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729919932] [2025-03-04 14:44:21,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729919932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:21,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:21,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050799368] [2025-03-04 14:44:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:21,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:21,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:21,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:21,093 INFO L87 Difference]: Start difference. First operand 618 states and 816 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:44:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:21,227 INFO L93 Difference]: Finished difference Result 672 states and 894 transitions. [2025-03-04 14:44:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:21,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:44:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:21,229 INFO L225 Difference]: With dead ends: 672 [2025-03-04 14:44:21,229 INFO L226 Difference]: Without dead ends: 671 [2025-03-04 14:44:21,230 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:44:21,230 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 185 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:21,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1078 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-04 14:44:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 617. [2025-03-04 14:44:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 554 states have (on average 1.3935018050541517) internal successors, (772), 587 states have internal predecessors, (772), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 815 transitions. [2025-03-04 14:44:21,252 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 815 transitions. Word has length 103 [2025-03-04 14:44:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:21,252 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 815 transitions. [2025-03-04 14:44:21,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:44:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 815 transitions. [2025-03-04 14:44:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 14:44:21,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:21,254 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, 1, 1, 1, 1] [2025-03-04 14:44:21,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 14:44:21,254 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2025-03-04 14:44:21,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1117180291, now seen corresponding path program 1 times [2025-03-04 14:44:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375959938] [2025-03-04 14:44:21,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:21,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 14:44:21,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 14:44:21,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:21,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375959938] [2025-03-04 14:44:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375959938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73716248] [2025-03-04 14:44:21,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:21,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:21,587 INFO L229 MonitoredProcess]: Starting monitored process 11 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:44:21,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process