./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/uniq-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/uniq-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 7199c457ec02eb80a800c3d45e6c59baf3403d683de615d2599dc8d811fbf1b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:43:08,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:43:08,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:43:08,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:43:08,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:43:08,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:43:08,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:43:08,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:43:08,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:43:08,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:43:08,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:43:08,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:43:08,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:43:08,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:43:08,333 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:43:08,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:43:08,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:43:08,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:43:08,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:43:08,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:43:08,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:43:08,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:43:08,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:43:08,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:43:08,336 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 -> 7199c457ec02eb80a800c3d45e6c59baf3403d683de615d2599dc8d811fbf1b6 [2025-03-04 14:43:08,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:43:08,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:43:08,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:43:08,582 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:43:08,583 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:43:08,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/uniq-2.i [2025-03-04 14:43:09,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a67de444/175d261a7059432f880cde4fa93d23af/FLAGb2dac7684 [2025-03-04 14:43:10,097 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:43:10,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/uniq-2.i [2025-03-04 14:43:10,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a67de444/175d261a7059432f880cde4fa93d23af/FLAGb2dac7684 [2025-03-04 14:43:10,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a67de444/175d261a7059432f880cde4fa93d23af [2025-03-04 14:43:10,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:43:10,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:43:10,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:43:10,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:43:10,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:43:10,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:43:10" (1/1) ... [2025-03-04 14:43:10,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ead840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:10, skipping insertion in model container [2025-03-04 14:43:10,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:43:10" (1/1) ... [2025-03-04 14:43:10,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:43:11,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:43:11,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:43:11,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:43:11,335 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:43:11,341 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:43:11,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11 WrapperNode [2025-03-04 14:43:11,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:43:11,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:43:11,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:43:11,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:43:11,347 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:43:11" (1/1) ... [2025-03-04 14:43:11,387 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:43:11" (1/1) ... [2025-03-04 14:43:11,461 INFO L138 Inliner]: procedures = 600, calls = 768, calls flagged for inlining = 31, calls inlined = 30, statements flattened = 2119 [2025-03-04 14:43:11,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:43:11,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:43:11,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:43:11,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:43:11,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,557 INFO L175 MemorySlicer]: Split 633 memory accesses to 21 slices as follows [2, 6, 6, 3, 17, 29, 11, 7, 13, 44, 30, 17, 3, 3, 15, 17, 3, 355, 33, 2, 17]. 56 percent of accesses are in the largest equivalence class. The 368 initializations are split as follows [2, 0, 0, 3, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 4, 0, 355, 0, 0, 0]. The 108 writes are split as follows [0, 3, 2, 0, 15, 0, 4, 7, 6, 12, 20, 17, 0, 0, 1, 4, 0, 0, 13, 1, 3]. [2025-03-04 14:43:11,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,636 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:43:11,684 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:43:11,684 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:43:11,684 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:43:11,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (1/1) ... [2025-03-04 14:43:11,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:43:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:11,710 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:43:11,712 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:43:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure xopen [2025-03-04 14:43:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure xopen [2025-03-04 14:43:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 14:43:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 14:43:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 14:43:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 14:43:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 14:43:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 14:43:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-03-04 14:43:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 14:43:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-04 14:43:11,730 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-04 14:43:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:43:11,731 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 14:43:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 14:43:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 14:43:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 14:43:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 14:43:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 14:43:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 14:43:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 14:43:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 14:43:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 14:43:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 14:43:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:43:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:43:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:43:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 14:43:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:43:11,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:43:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-03-04 14:43:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:43:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:43:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:43:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:43:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:43:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-03-04 14:43:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:43:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 14:43:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-03-04 14:43:11,740 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 14:43:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-04 14:43:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-04 14:43:11,741 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 14:43:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-04 14:43:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:43:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 14:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-04 14:43:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:43:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:43:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:43:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:43:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 14:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 14:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 14:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 14:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 14:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 14:43:12,191 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:43:12,193 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:43:15,644 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: 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:43:15,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3147: call ULTIMATE.dealloc(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset);havoc xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset; [2025-03-04 14:43:15,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: call ULTIMATE.dealloc(__main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset);havoc __main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset;call ULTIMATE.dealloc(__main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset);havoc __main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset;call ULTIMATE.dealloc(__main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset);havoc __main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset; [2025-03-04 14:43:15,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: havoc _IO_getc_#t~nondet261#1; [2025-03-04 14:43:15,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3338: havoc getopt_long_#t~ret297#1; [2025-03-04 14:43:15,927 INFO L? ?]: Removed 859 outVars from TransFormulas that were not future-live. [2025-03-04 14:43:15,927 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:43:15,959 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:43:15,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:43:15,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:43:15 BoogieIcfgContainer [2025-03-04 14:43:15,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:43:15,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:43:15,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:43:15,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:43:15,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:43:10" (1/3) ... [2025-03-04 14:43:15,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32394169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:43:15, skipping insertion in model container [2025-03-04 14:43:15,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:43:11" (2/3) ... [2025-03-04 14:43:15,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32394169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:43:15, skipping insertion in model container [2025-03-04 14:43:15,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:43:15" (3/3) ... [2025-03-04 14:43:15,968 INFO L128 eAbstractionObserver]: Analyzing ICFG uniq-2.i [2025-03-04 14:43:15,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:43:15,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uniq-2.i that has 72 procedures, 830 locations, 1 initial locations, 77 loop locations, and 70 error locations. [2025-03-04 14:43:16,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:43:16,047 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;@58ee5d11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:43:16,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-04 14:43:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 606 states, 488 states have (on average 1.6475409836065573) internal successors, (804), 565 states have internal predecessors, (804), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:43:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:43:16,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:16,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:43:16,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash 41218751, now seen corresponding path program 1 times [2025-03-04 14:43:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752275786] [2025-03-04 14:43:16,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:16,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:43:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:43:16,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:16,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:16,734 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:43:16,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:16,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752275786] [2025-03-04 14:43:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752275786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:16,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:16,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544699164] [2025-03-04 14:43:16,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:16,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:16,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:16,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:16,758 INFO L87 Difference]: Start difference. First operand has 606 states, 488 states have (on average 1.6475409836065573) internal successors, (804), 565 states have internal predecessors, (804), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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:43:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:16,920 INFO L93 Difference]: Finished difference Result 1102 states and 1622 transitions. [2025-03-04 14:43:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:16,922 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:43:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:16,933 INFO L225 Difference]: With dead ends: 1102 [2025-03-04 14:43:16,933 INFO L226 Difference]: Without dead ends: 497 [2025-03-04 14:43:16,939 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,940 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 1 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:16,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1326 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-04 14:43:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-03-04 14:43:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 416 states have (on average 1.5504807692307692) internal successors, (645), 468 states have internal predecessors, (645), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 689 transitions. [2025-03-04 14:43:17,002 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 689 transitions. Word has length 4 [2025-03-04 14:43:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:17,003 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 689 transitions. [2025-03-04 14:43:17,003 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:43:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 689 transitions. [2025-03-04 14:43:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:43:17,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:17,004 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:43:17,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:43:17,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:17,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash -411571400, now seen corresponding path program 1 times [2025-03-04 14:43:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:17,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196107674] [2025-03-04 14:43:17,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:17,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:43:17,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:43:17,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:17,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:17,474 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:43:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196107674] [2025-03-04 14:43:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196107674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061473713] [2025-03-04 14:43:17,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:17,477 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:43:17,479 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:43:17,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:43:18,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:43:18,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:18,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:18,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:18,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:18,121 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:18,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:43:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061473713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:43:18,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:43:18,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615785103] [2025-03-04 14:43:18,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:18,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:43:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:18,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:43:18,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:18,123 INFO L87 Difference]: Start difference. First operand 497 states and 689 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:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:18,205 INFO L93 Difference]: Finished difference Result 497 states and 689 transitions. [2025-03-04 14:43:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:43:18,205 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:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:18,207 INFO L225 Difference]: With dead ends: 497 [2025-03-04 14:43:18,208 INFO L226 Difference]: Without dead ends: 496 [2025-03-04 14:43:18,208 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:18,209 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 1 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:18,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1315 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-04 14:43:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-04 14:43:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 416 states have (on average 1.5480769230769231) internal successors, (644), 467 states have internal predecessors, (644), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 688 transitions. [2025-03-04 14:43:18,236 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 688 transitions. Word has length 7 [2025-03-04 14:43:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:18,236 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 688 transitions. [2025-03-04 14:43:18,236 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:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 688 transitions. [2025-03-04 14:43:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:43:18,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:18,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:43:18,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:43:18,437 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:18,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:18,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash 126189761, now seen corresponding path program 1 times [2025-03-04 14:43:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:18,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949981777] [2025-03-04 14:43:18,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:18,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:18,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:43:18,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:43:18,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:18,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:18,742 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:18,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:18,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949981777] [2025-03-04 14:43:18,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949981777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:18,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516730547] [2025-03-04 14:43:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:18,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:18,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:18,744 INFO L87 Difference]: Start difference. First operand 496 states and 688 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:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:18,817 INFO L93 Difference]: Finished difference Result 496 states and 688 transitions. [2025-03-04 14:43:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:18,817 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:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:18,819 INFO L225 Difference]: With dead ends: 496 [2025-03-04 14:43:18,819 INFO L226 Difference]: Without dead ends: 495 [2025-03-04 14:43:18,820 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:18,820 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 0 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:18,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1316 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-04 14:43:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2025-03-04 14:43:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 464 states have internal predecessors, (641), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 685 transitions. [2025-03-04 14:43:18,832 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 685 transitions. Word has length 8 [2025-03-04 14:43:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:18,832 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 685 transitions. [2025-03-04 14:43:18,832 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:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 685 transitions. [2025-03-04 14:43:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:43:18,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:18,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:18,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:43:18,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -114012516, now seen corresponding path program 1 times [2025-03-04 14:43:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730948562] [2025-03-04 14:43:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:19,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:43:19,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:43:19,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:19,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:19,197 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:19,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:19,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730948562] [2025-03-04 14:43:19,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730948562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:19,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012000997] [2025-03-04 14:43:19,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:19,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:19,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:19,200 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:19,201 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:19,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:43:19,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:43:19,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:19,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:19,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:43:19,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:19,771 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:19,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:43:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012000997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:19,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:43:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:43:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949118723] [2025-03-04 14:43:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:19,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:19,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:19,772 INFO L87 Difference]: Start difference. First operand 493 states and 685 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:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:19,869 INFO L93 Difference]: Finished difference Result 493 states and 685 transitions. [2025-03-04 14:43:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:19,871 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:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:19,873 INFO L225 Difference]: With dead ends: 493 [2025-03-04 14:43:19,873 INFO L226 Difference]: Without dead ends: 491 [2025-03-04 14:43:19,873 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:19,873 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 568 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:19,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 747 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-04 14:43:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2025-03-04 14:43:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 414 states have (on average 1.5434782608695652) internal successors, (639), 462 states have internal predecessors, (639), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 683 transitions. [2025-03-04 14:43:19,893 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 683 transitions. Word has length 12 [2025-03-04 14:43:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:19,894 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 683 transitions. [2025-03-04 14:43:19,894 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:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 683 transitions. [2025-03-04 14:43:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:43:19,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:19,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:19,905 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:20,095 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:20,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 760580567, now seen corresponding path program 1 times [2025-03-04 14:43:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:20,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391268410] [2025-03-04 14:43:20,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:20,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:43:20,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:43:20,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:20,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:20,424 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:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391268410] [2025-03-04 14:43:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391268410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264934726] [2025-03-04 14:43:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:20,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:20,426 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:20,428 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:20,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:43:21,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:43:21,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:21,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:21,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:21,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:21,035 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:21,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:43:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264934726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:21,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:43:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109689536] [2025-03-04 14:43:21,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:21,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:21,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:21,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:21,068 INFO L87 Difference]: Start difference. First operand 491 states and 683 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:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:21,203 INFO L93 Difference]: Finished difference Result 985 states and 1371 transitions. [2025-03-04 14:43:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:21,204 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:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:21,206 INFO L225 Difference]: With dead ends: 985 [2025-03-04 14:43:21,206 INFO L226 Difference]: Without dead ends: 500 [2025-03-04 14:43:21,207 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:21,208 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 4 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:21,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2622 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-04 14:43:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-04 14:43:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 423 states have (on average 1.5319148936170213) internal successors, (648), 471 states have internal predecessors, (648), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 692 transitions. [2025-03-04 14:43:21,229 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 692 transitions. Word has length 13 [2025-03-04 14:43:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:21,230 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 692 transitions. [2025-03-04 14:43:21,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:43:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 692 transitions. [2025-03-04 14:43:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:43:21,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:21,231 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:43:21,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:43:21,438 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:21,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:21,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:21,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1497564450, now seen corresponding path program 2 times [2025-03-04 14:43:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934542302] [2025-03-04 14:43:21,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:21,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:21,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:43:21,671 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:21,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:43:21,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:21,896 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:21,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:21,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934542302] [2025-03-04 14:43:21,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934542302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:21,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:21,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:43:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817690577] [2025-03-04 14:43:21,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:21,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:43:21,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:21,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:43:21,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:21,897 INFO L87 Difference]: Start difference. First operand 500 states and 692 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:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:22,064 INFO L93 Difference]: Finished difference Result 500 states and 692 transitions. [2025-03-04 14:43:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:43:22,064 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:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:22,066 INFO L225 Difference]: With dead ends: 500 [2025-03-04 14:43:22,066 INFO L226 Difference]: Without dead ends: 498 [2025-03-04 14:43:22,066 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:22,067 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 567 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:22,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 2023 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-04 14:43:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-04 14:43:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 423 states have (on average 1.5271867612293144) internal successors, (646), 469 states have internal predecessors, (646), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 690 transitions. [2025-03-04 14:43:22,083 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 690 transitions. Word has length 22 [2025-03-04 14:43:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:22,083 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 690 transitions. [2025-03-04 14:43:22,086 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:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 690 transitions. [2025-03-04 14:43:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:43:22,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:22,087 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:22,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:43:22,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:22,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1927904400, now seen corresponding path program 1 times [2025-03-04 14:43:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:22,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704960444] [2025-03-04 14:43:22,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:22,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:43:22,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:43:22,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:22,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:22,430 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:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704960444] [2025-03-04 14:43:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704960444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:22,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:43:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067079289] [2025-03-04 14:43:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:22,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:22,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:22,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:22,432 INFO L87 Difference]: Start difference. First operand 498 states and 690 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:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:22,558 INFO L93 Difference]: Finished difference Result 979 states and 1364 transitions. [2025-03-04 14:43:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:22,559 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:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:22,562 INFO L225 Difference]: With dead ends: 979 [2025-03-04 14:43:22,562 INFO L226 Difference]: Without dead ends: 501 [2025-03-04 14:43:22,563 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:22,563 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 2 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:22,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1305 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-04 14:43:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-03-04 14:43:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 426 states have (on average 1.5234741784037558) internal successors, (649), 472 states have internal predecessors, (649), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 693 transitions. [2025-03-04 14:43:22,580 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 693 transitions. Word has length 27 [2025-03-04 14:43:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:22,581 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 693 transitions. [2025-03-04 14:43:22,581 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:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 693 transitions. [2025-03-04 14:43:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 14:43:22,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:22,581 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:22,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:43:22,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 364172344, now seen corresponding path program 1 times [2025-03-04 14:43:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582174868] [2025-03-04 14:43:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:22,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 14:43:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 14:43:22,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:22,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:22,922 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:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582174868] [2025-03-04 14:43:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582174868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162677722] [2025-03-04 14:43:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:22,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:22,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:22,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:22,923 INFO L87 Difference]: Start difference. First operand 501 states and 693 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:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:23,038 INFO L93 Difference]: Finished difference Result 799 states and 1132 transitions. [2025-03-04 14:43:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:23,039 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:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:23,042 INFO L225 Difference]: With dead ends: 799 [2025-03-04 14:43:23,042 INFO L226 Difference]: Without dead ends: 797 [2025-03-04 14:43:23,042 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:23,044 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 411 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:23,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1292 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-04 14:43:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 505. [2025-03-04 14:43:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 430 states have (on average 1.5209302325581395) internal successors, (654), 476 states have internal predecessors, (654), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 698 transitions. [2025-03-04 14:43:23,064 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 698 transitions. Word has length 28 [2025-03-04 14:43:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:23,064 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 698 transitions. [2025-03-04 14:43:23,064 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:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 698 transitions. [2025-03-04 14:43:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:43:23,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:23,066 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:23,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:43:23,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:23,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1891283561, now seen corresponding path program 1 times [2025-03-04 14:43:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404287542] [2025-03-04 14:43:23,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:23,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:43:23,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:43:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:23,365 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:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:23,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404287542] [2025-03-04 14:43:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404287542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:23,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:23,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:23,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649505007] [2025-03-04 14:43:23,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:23,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:23,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:23,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:23,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:23,366 INFO L87 Difference]: Start difference. First operand 505 states and 698 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:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:23,472 INFO L93 Difference]: Finished difference Result 518 states and 713 transitions. [2025-03-04 14:43:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:23,474 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:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:23,476 INFO L225 Difference]: With dead ends: 518 [2025-03-04 14:43:23,476 INFO L226 Difference]: Without dead ends: 516 [2025-03-04 14:43:23,476 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:23,477 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 3 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:23,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1302 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-04 14:43:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2025-03-04 14:43:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 485 states have internal predecessors, (667), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 711 transitions. [2025-03-04 14:43:23,495 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 711 transitions. Word has length 30 [2025-03-04 14:43:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:23,495 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 711 transitions. [2025-03-04 14:43:23,495 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:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 711 transitions. [2025-03-04 14:43:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:43:23,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:23,496 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:23,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:43:23,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:23,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1891283401, now seen corresponding path program 1 times [2025-03-04 14:43:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264650487] [2025-03-04 14:43:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:23,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:43:23,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:43:23,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:23,864 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:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264650487] [2025-03-04 14:43:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264650487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268182854] [2025-03-04 14:43:23,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:23,867 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:23,869 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:24,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:43:24,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:43:24,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:24,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:24,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:43:24,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:24,614 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:24,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:24,714 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:24,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268182854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:24,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:24,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:43:24,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632453751] [2025-03-04 14:43:24,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:24,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:43:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:24,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:43:24,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:43:24,715 INFO L87 Difference]: Start difference. First operand 514 states and 711 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:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:24,926 INFO L93 Difference]: Finished difference Result 1030 states and 1430 transitions. [2025-03-04 14:43:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:43:24,927 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:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:24,929 INFO L225 Difference]: With dead ends: 1030 [2025-03-04 14:43:24,929 INFO L226 Difference]: Without dead ends: 531 [2025-03-04 14:43:24,930 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:24,930 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 5 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:24,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3237 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:43:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-04 14:43:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-04 14:43:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 457 states have (on average 1.4945295404814005) internal successors, (683), 502 states have internal predecessors, (683), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 727 transitions. [2025-03-04 14:43:24,950 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 727 transitions. Word has length 30 [2025-03-04 14:43:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:24,951 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 727 transitions. [2025-03-04 14:43:24,951 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:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 727 transitions. [2025-03-04 14:43:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:43:24,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:24,954 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:24,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:43:25,155 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:25,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:25,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1946910066, now seen corresponding path program 1 times [2025-03-04 14:43:25,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:25,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156545998] [2025-03-04 14:43:25,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:25,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:43:25,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:43:25,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:25,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:25,462 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:25,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:25,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156545998] [2025-03-04 14:43:25,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156545998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:25,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:25,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:25,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584858511] [2025-03-04 14:43:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:25,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:25,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:25,465 INFO L87 Difference]: Start difference. First operand 531 states and 727 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:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:25,530 INFO L93 Difference]: Finished difference Result 531 states and 727 transitions. [2025-03-04 14:43:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:25,531 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:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:25,533 INFO L225 Difference]: With dead ends: 531 [2025-03-04 14:43:25,533 INFO L226 Difference]: Without dead ends: 530 [2025-03-04 14:43:25,533 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:25,534 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 0 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:25,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-04 14:43:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 526. [2025-03-04 14:43:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 453 states have (on average 1.4944812362030906) internal successors, (677), 497 states have internal predecessors, (677), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 721 transitions. [2025-03-04 14:43:25,550 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 721 transitions. Word has length 49 [2025-03-04 14:43:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:25,551 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 721 transitions. [2025-03-04 14:43:25,551 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:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 721 transitions. [2025-03-04 14:43:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:43:25,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:25,554 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:25,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:43:25,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:25,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash 113306140, now seen corresponding path program 1 times [2025-03-04 14:43:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090493046] [2025-03-04 14:43:25,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:25,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:43:25,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:43:25,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:25,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:25,904 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:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090493046] [2025-03-04 14:43:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090493046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549145102] [2025-03-04 14:43:25,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:25,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:25,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:25,906 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:25,910 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:26,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:43:26,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:43:26,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:26,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:26,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:26,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:26,664 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:26,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:43:26,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549145102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:26,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:43:26,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:43:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837664075] [2025-03-04 14:43:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:26,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:43:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:26,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:43:26,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:43:26,665 INFO L87 Difference]: Start difference. First operand 526 states and 721 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:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:26,817 INFO L93 Difference]: Finished difference Result 822 states and 1159 transitions. [2025-03-04 14:43:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:43:26,818 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:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:26,820 INFO L225 Difference]: With dead ends: 822 [2025-03-04 14:43:26,820 INFO L226 Difference]: Without dead ends: 821 [2025-03-04 14:43:26,821 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:26,821 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 821 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:26,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1702 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-04 14:43:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 525. [2025-03-04 14:43:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 453 states have (on average 1.4922737306843268) internal successors, (676), 496 states have internal predecessors, (676), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 720 transitions. [2025-03-04 14:43:26,835 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 720 transitions. Word has length 50 [2025-03-04 14:43:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:26,835 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 720 transitions. [2025-03-04 14:43:26,835 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:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 720 transitions. [2025-03-04 14:43:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:43:26,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:26,836 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:26,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:43:27,036 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:27,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash -782475713, now seen corresponding path program 1 times [2025-03-04 14:43:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750499294] [2025-03-04 14:43:27,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:27,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:43:27,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:43:27,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:27,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:27,426 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:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750499294] [2025-03-04 14:43:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750499294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042762442] [2025-03-04 14:43:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:27,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:27,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:27,433 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:27,435 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:28,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:43:28,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:43:28,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:28,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:28,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:28,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:28,255 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:28,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:28,283 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:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042762442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:28,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:43:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34106369] [2025-03-04 14:43:28,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:28,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:28,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:28,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:28,284 INFO L87 Difference]: Start difference. First operand 525 states and 720 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:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:28,681 INFO L93 Difference]: Finished difference Result 1706 states and 2466 transitions. [2025-03-04 14:43:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:28,681 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:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:28,688 INFO L225 Difference]: With dead ends: 1706 [2025-03-04 14:43:28,688 INFO L226 Difference]: Without dead ends: 1705 [2025-03-04 14:43:28,689 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:28,690 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 2054 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 3510 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:28,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 3510 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:43:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-03-04 14:43:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 537. [2025-03-04 14:43:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 465 states have (on average 1.4860215053763441) internal successors, (691), 508 states have internal predecessors, (691), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 735 transitions. [2025-03-04 14:43:28,715 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 735 transitions. Word has length 51 [2025-03-04 14:43:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:28,716 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 735 transitions. [2025-03-04 14:43:28,716 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:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 735 transitions. [2025-03-04 14:43:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:43:28,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:28,716 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:28,728 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:28,917 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:28,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1253970584, now seen corresponding path program 1 times [2025-03-04 14:43:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932145394] [2025-03-04 14:43:28,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:29,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:43:29,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:43:29,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:29,229 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:29,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:29,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932145394] [2025-03-04 14:43:29,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932145394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:29,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341330523] [2025-03-04 14:43:29,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:29,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:29,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:29,232 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:29,233 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:29,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:43:29,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:43:30,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:30,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:30,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:43:30,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:43:30,033 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:30,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:43:30,062 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:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341330523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:43:30,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:43:30,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:43:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145465385] [2025-03-04 14:43:30,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:43:30,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:43:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:30,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:43:30,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:43:30,064 INFO L87 Difference]: Start difference. First operand 537 states and 735 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:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:30,170 INFO L93 Difference]: Finished difference Result 1049 states and 1447 transitions. [2025-03-04 14:43:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:30,170 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:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:30,173 INFO L225 Difference]: With dead ends: 1049 [2025-03-04 14:43:30,173 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 14:43:30,174 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:30,174 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 4 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:30,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1950 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 14:43:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-04 14:43:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 483 states have (on average 1.4679089026915113) internal successors, (709), 526 states have internal predecessors, (709), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:43:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 753 transitions. [2025-03-04 14:43:30,188 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 753 transitions. Word has length 55 [2025-03-04 14:43:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:30,189 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 753 transitions. [2025-03-04 14:43:30,189 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:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 753 transitions. [2025-03-04 14:43:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:43:30,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:30,190 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:30,202 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:30,390 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:30,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:30,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash -26813800, now seen corresponding path program 1 times [2025-03-04 14:43:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:30,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709529621] [2025-03-04 14:43:30,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:30,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:43:30,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:43:30,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:30,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:30,726 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:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:30,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709529621] [2025-03-04 14:43:30,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709529621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:30,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:30,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:30,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973375804] [2025-03-04 14:43:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:30,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:30,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:30,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:30,728 INFO L87 Difference]: Start difference. First operand 555 states and 753 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:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:30,899 INFO L93 Difference]: Finished difference Result 1101 states and 1528 transitions. [2025-03-04 14:43:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:30,900 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:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:30,902 INFO L225 Difference]: With dead ends: 1101 [2025-03-04 14:43:30,902 INFO L226 Difference]: Without dead ends: 650 [2025-03-04 14:43:30,904 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:30,904 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 119 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:30,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1250 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-04 14:43:30,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 597. [2025-03-04 14:43:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 567 states have internal predecessors, (765), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 811 transitions. [2025-03-04 14:43:30,923 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 811 transitions. Word has length 60 [2025-03-04 14:43:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:30,923 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 811 transitions. [2025-03-04 14:43:30,923 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:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 811 transitions. [2025-03-04 14:43:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:43:30,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:30,924 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:30,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:43:30,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1780982, now seen corresponding path program 1 times [2025-03-04 14:43:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454182609] [2025-03-04 14:43:30,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:43:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:31,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:43:31,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:43:31,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:43:31,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:31,231 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:31,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454182609] [2025-03-04 14:43:31,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454182609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:31,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:31,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:43:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638557244] [2025-03-04 14:43:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:31,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:43:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:31,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:43:31,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:43:31,233 INFO L87 Difference]: Start difference. First operand 597 states and 811 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:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:31,318 INFO L93 Difference]: Finished difference Result 599 states and 811 transitions. [2025-03-04 14:43:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:43:31,318 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:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:31,321 INFO L225 Difference]: With dead ends: 599 [2025-03-04 14:43:31,321 INFO L226 Difference]: Without dead ends: 597 [2025-03-04 14:43:31,321 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:31,321 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:31,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1301 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:43:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-04 14:43:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-04 14:43:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 524 states have (on average 1.4561068702290076) internal successors, (763), 567 states have internal predecessors, (763), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 809 transitions. [2025-03-04 14:43:31,344 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 809 transitions. Word has length 62 [2025-03-04 14:43:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:31,345 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 809 transitions. [2025-03-04 14:43:31,345 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:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 809 transitions. [2025-03-04 14:43:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 14:43:31,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:31,345 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:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:43:31,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:31,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1232696947, now seen corresponding path program 2 times [2025-03-04 14:43:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:31,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850611503] [2025-03-04 14:43:31,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:31,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:31,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-04 14:43:31,674 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:31,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:43:31,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:31,866 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:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850611503] [2025-03-04 14:43:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850611503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:43:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:43:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:43:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298554024] [2025-03-04 14:43:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:43:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:43:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:43:31,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:43:31,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:43:31,867 INFO L87 Difference]: Start difference. First operand 597 states and 809 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:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:43:32,094 INFO L93 Difference]: Finished difference Result 1122 states and 1540 transitions. [2025-03-04 14:43:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:43:32,094 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:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:43:32,097 INFO L225 Difference]: With dead ends: 1122 [2025-03-04 14:43:32,097 INFO L226 Difference]: Without dead ends: 597 [2025-03-04 14:43:32,098 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:32,099 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 568 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:43:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 2630 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:43:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-04 14:43:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-04 14:43:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 524 states have (on average 1.4541984732824427) internal successors, (762), 567 states have internal predecessors, (762), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:43:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 808 transitions. [2025-03-04 14:43:32,118 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 808 transitions. Word has length 63 [2025-03-04 14:43:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:43:32,119 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 808 transitions. [2025-03-04 14:43:32,119 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:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 808 transitions. [2025-03-04 14:43:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:43:32,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:43:32,119 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:32,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 14:43:32,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:43:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:43:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1596791000, now seen corresponding path program 2 times [2025-03-04 14:43:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:43:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557830980] [2025-03-04 14:43:32,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:43:32,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:43:32,379 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:32,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:43:32,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:43:32,553 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:32,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:43:32,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557830980] [2025-03-04 14:43:32,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557830980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:43:32,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797950615] [2025-03-04 14:43:32,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:43:32,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:43:32,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:43:32,556 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:32,558 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:33,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:44:17,762 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:17,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:44:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:17,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:17,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:17,836 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:17,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:17,922 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:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797950615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:17,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:44:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861705602] [2025-03-04 14:44:17,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:17,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:44:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:17,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:44:17,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:44:17,923 INFO L87 Difference]: Start difference. First operand 597 states and 808 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:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:18,394 INFO L93 Difference]: Finished difference Result 1177 states and 1609 transitions. [2025-03-04 14:44:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 14:44:18,395 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:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:18,397 INFO L225 Difference]: With dead ends: 1177 [2025-03-04 14:44:18,397 INFO L226 Difference]: Without dead ends: 632 [2025-03-04 14:44:18,399 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:18,400 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 9 mSDsluCounter, 3220 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3867 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:18,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3867 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-04 14:44:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2025-03-04 14:44:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 560 states have (on average 1.4232142857142858) internal successors, (797), 602 states have internal predecessors, (797), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 843 transitions. [2025-03-04 14:44:18,414 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 843 transitions. Word has length 73 [2025-03-04 14:44:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:18,414 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 843 transitions. [2025-03-04 14:44:18,414 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:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 843 transitions. [2025-03-04 14:44:18,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 14:44:18,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:18,416 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:18,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 14:44:18,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 14:44:18,617 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash -561254245, now seen corresponding path program 1 times [2025-03-04 14:44:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252830356] [2025-03-04 14:44:18,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:18,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:44:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:44:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:19,116 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:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252830356] [2025-03-04 14:44:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252830356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575418193] [2025-03-04 14:44:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:19,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:19,119 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:19,120 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:19,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:44:19,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:44:19,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:19,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:20,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:20,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:20,056 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:20,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:20,128 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:20,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575418193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:20,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:20,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 14:44:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373398242] [2025-03-04 14:44:20,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:20,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:44:20,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:20,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:44:20,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:20,130 INFO L87 Difference]: Start difference. First operand 632 states and 843 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:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:20,748 INFO L93 Difference]: Finished difference Result 3997 states and 5759 transitions. [2025-03-04 14:44:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:44:20,748 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:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:20,761 INFO L225 Difference]: With dead ends: 3997 [2025-03-04 14:44:20,761 INFO L226 Difference]: Without dead ends: 3996 [2025-03-04 14:44:20,762 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:20,763 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 5743 mSDsluCounter, 6903 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5823 SdHoareTripleChecker+Valid, 7549 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:20,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5823 Valid, 7549 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:44:20,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2025-03-04 14:44:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 656. [2025-03-04 14:44:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 584 states have (on average 1.4160958904109588) internal successors, (827), 626 states have internal predecessors, (827), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 873 transitions. [2025-03-04 14:44:20,803 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 873 transitions. Word has length 97 [2025-03-04 14:44:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:20,803 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 873 transitions. [2025-03-04 14:44:20,803 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:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 873 transitions. [2025-03-04 14:44:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:44:20,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:20,804 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:20,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:21,005 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:21,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 988007402, now seen corresponding path program 1 times [2025-03-04 14:44:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043724533] [2025-03-04 14:44:21,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:21,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:44:21,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:44:21,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:21,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:21,371 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,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043724533] [2025-03-04 14:44:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043724533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:21,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:21,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914929928] [2025-03-04 14:44:21,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:21,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:21,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:21,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:21,372 INFO L87 Difference]: Start difference. First operand 656 states and 873 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:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:21,576 INFO L93 Difference]: Finished difference Result 709 states and 952 transitions. [2025-03-04 14:44:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:21,576 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:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:21,579 INFO L225 Difference]: With dead ends: 709 [2025-03-04 14:44:21,579 INFO L226 Difference]: Without dead ends: 704 [2025-03-04 14:44:21,579 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,580 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 188 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:21,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1097 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-03-04 14:44:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 651. [2025-03-04 14:44:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 584 states have (on average 1.4075342465753424) internal successors, (822), 621 states have internal predecessors, (822), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 868 transitions. [2025-03-04 14:44:21,617 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 868 transitions. Word has length 102 [2025-03-04 14:44:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:21,617 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 868 transitions. [2025-03-04 14:44:21,618 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:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 868 transitions. [2025-03-04 14:44:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:44:21,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:21,618 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:21,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:44:21,619 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:21,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash 563459410, now seen corresponding path program 1 times [2025-03-04 14:44:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:21,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922324618] [2025-03-04 14:44:21,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:21,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:44:21,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:44:21,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:21,959 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,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922324618] [2025-03-04 14:44:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922324618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:21,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721263890] [2025-03-04 14:44:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:21,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:21,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:21,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:21,960 INFO L87 Difference]: Start difference. First operand 651 states and 868 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:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:22,120 INFO L93 Difference]: Finished difference Result 704 states and 947 transitions. [2025-03-04 14:44:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:22,120 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:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:22,122 INFO L225 Difference]: With dead ends: 704 [2025-03-04 14:44:22,122 INFO L226 Difference]: Without dead ends: 699 [2025-03-04 14:44:22,123 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:22,123 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 186 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:22,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1151 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-04 14:44:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 634. [2025-03-04 14:44:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 572 states have (on average 1.3986013986013985) internal successors, (800), 604 states have internal predecessors, (800), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 846 transitions. [2025-03-04 14:44:22,142 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 846 transitions. Word has length 103 [2025-03-04 14:44:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:22,142 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 846 transitions. [2025-03-04 14:44:22,142 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:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 846 transitions. [2025-03-04 14:44:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 14:44:22,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:22,144 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:22,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:44:22,144 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1159919808, now seen corresponding path program 1 times [2025-03-04 14:44:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:22,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945474944] [2025-03-04 14:44:22,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:22,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:22,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 14:44:22,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 14:44:22,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:22,625 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:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:22,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945474944] [2025-03-04 14:44:22,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945474944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:22,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129519729] [2025-03-04 14:44:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:22,630 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:22,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:44:23,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 14:44:23,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 14:44:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:23,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:23,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 2093 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:44:23,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:23,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:23,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129519729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:23,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:44:23,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 14:44:23,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425132333] [2025-03-04 14:44:23,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:23,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:44:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:23,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:44:23,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:23,692 INFO L87 Difference]: Start difference. First operand 634 states and 846 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:44:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:23,903 INFO L93 Difference]: Finished difference Result 1195 states and 1649 transitions. [2025-03-04 14:44:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:44:23,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 105 [2025-03-04 14:44:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:23,908 INFO L225 Difference]: With dead ends: 1195 [2025-03-04 14:44:23,908 INFO L226 Difference]: Without dead ends: 752 [2025-03-04 14:44:23,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:23,910 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 284 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:23,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2442 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-04 14:44:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 635. [2025-03-04 14:44:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 575 states have (on average 1.3930434782608696) internal successors, (801), 605 states have internal predecessors, (801), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 847 transitions. [2025-03-04 14:44:23,927 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 847 transitions. Word has length 105 [2025-03-04 14:44:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:23,927 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 847 transitions. [2025-03-04 14:44:23,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:44:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 847 transitions. [2025-03-04 14:44:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 14:44:23,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:23,929 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 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, 1] [2025-03-04 14:44:23,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:24,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 14:44:24,129 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:24,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2134645862, now seen corresponding path program 1 times [2025-03-04 14:44:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663996407] [2025-03-04 14:44:24,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:24,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 14:44:24,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 14:44:24,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:24,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-04 14:44:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663996407] [2025-03-04 14:44:24,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663996407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:24,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:24,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117789446] [2025-03-04 14:44:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:24,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:24,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:24,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:24,424 INFO L87 Difference]: Start difference. First operand 635 states and 847 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:24,503 INFO L93 Difference]: Finished difference Result 635 states and 847 transitions. [2025-03-04 14:44:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-04 14:44:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:24,510 INFO L225 Difference]: With dead ends: 635 [2025-03-04 14:44:24,510 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 14:44:24,510 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:24,511 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1275 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:44:24,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1275 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 14:44:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-03-04 14:44:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 575 states have (on average 1.391304347826087) internal successors, (800), 604 states have internal predecessors, (800), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 846 transitions. [2025-03-04 14:44:24,539 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 846 transitions. Word has length 108 [2025-03-04 14:44:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:24,540 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 846 transitions. [2025-03-04 14:44:24,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 846 transitions. [2025-03-04 14:44:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 14:44:24,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:24,545 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 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:24,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 14:44:24,545 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:24,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1749511067, now seen corresponding path program 1 times [2025-03-04 14:44:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:24,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214932558] [2025-03-04 14:44:24,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:24,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 14:44:24,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 14:44:24,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:24,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 14:44:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214932558] [2025-03-04 14:44:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214932558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:44:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047668872] [2025-03-04 14:44:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:24,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:24,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:24,955 INFO L87 Difference]: Start difference. First operand 634 states and 846 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:25,042 INFO L93 Difference]: Finished difference Result 1106 states and 1511 transitions. [2025-03-04 14:44:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-03-04 14:44:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:25,044 INFO L225 Difference]: With dead ends: 1106 [2025-03-04 14:44:25,044 INFO L226 Difference]: Without dead ends: 635 [2025-03-04 14:44:25,045 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:44:25,046 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 0 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:25,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1274 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-04 14:44:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-03-04 14:44:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 576 states have (on average 1.390625) internal successors, (801), 605 states have internal predecessors, (801), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 847 transitions. [2025-03-04 14:44:25,074 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 847 transitions. Word has length 109 [2025-03-04 14:44:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:25,075 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 847 transitions. [2025-03-04 14:44:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 847 transitions. [2025-03-04 14:44:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 14:44:25,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:25,076 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 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:25,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 14:44:25,078 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1340686842, now seen corresponding path program 1 times [2025-03-04 14:44:25,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:25,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200005498] [2025-03-04 14:44:25,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:25,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 14:44:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 14:44:25,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:25,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 14:44:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200005498] [2025-03-04 14:44:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200005498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:44:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844131563] [2025-03-04 14:44:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:25,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:44:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:25,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:44:25,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:44:25,668 INFO L87 Difference]: Start difference. First operand 635 states and 847 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:25,752 INFO L93 Difference]: Finished difference Result 1115 states and 1523 transitions. [2025-03-04 14:44:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:44:25,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-03-04 14:44:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:25,755 INFO L225 Difference]: With dead ends: 1115 [2025-03-04 14:44:25,755 INFO L226 Difference]: Without dead ends: 636 [2025-03-04 14:44:25,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:44:25,756 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 0 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:25,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-04 14:44:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2025-03-04 14:44:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 577 states have (on average 1.389948006932409) internal successors, (802), 606 states have internal predecessors, (802), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 848 transitions. [2025-03-04 14:44:25,775 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 848 transitions. Word has length 109 [2025-03-04 14:44:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 848 transitions. [2025-03-04 14:44:25,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 848 transitions. [2025-03-04 14:44:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 14:44:25,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:25,776 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 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, 1] [2025-03-04 14:44:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 14:44:25,776 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1935309332, now seen corresponding path program 1 times [2025-03-04 14:44:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570597024] [2025-03-04 14:44:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:25,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:44:25,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:44:25,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:25,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 14:44:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570597024] [2025-03-04 14:44:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570597024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732986246] [2025-03-04 14:44:26,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:26,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:26,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:26,358 INFO L229 MonitoredProcess]: Starting monitored process 12 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:26,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:44:27,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:44:27,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:44:27,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:27,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 2116 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:44:27,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 14:44:27,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 14:44:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732986246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:27,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 14:44:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091351255] [2025-03-04 14:44:27,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:27,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:44:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:27,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:44:27,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:44:27,642 INFO L87 Difference]: Start difference. First operand 636 states and 848 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:44:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:27,851 INFO L93 Difference]: Finished difference Result 1120 states and 1530 transitions. [2025-03-04 14:44:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:44:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 110 [2025-03-04 14:44:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:27,854 INFO L225 Difference]: With dead ends: 1120 [2025-03-04 14:44:27,854 INFO L226 Difference]: Without dead ends: 639 [2025-03-04 14:44:27,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:27,855 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 0 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:27,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3193 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-04 14:44:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-03-04 14:44:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 580 states have (on average 1.3879310344827587) internal successors, (805), 609 states have internal predecessors, (805), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 851 transitions. [2025-03-04 14:44:27,875 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 851 transitions. Word has length 110 [2025-03-04 14:44:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:27,875 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 851 transitions. [2025-03-04 14:44:27,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:44:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 851 transitions. [2025-03-04 14:44:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 14:44:27,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:27,877 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:27,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 14:44:28,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 14:44:28,078 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:28,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:28,078 INFO L85 PathProgramCache]: Analyzing trace with hash 134560076, now seen corresponding path program 1 times [2025-03-04 14:44:28,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:28,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024100994] [2025-03-04 14:44:28,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:28,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:28,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:44:28,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:44:28,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:28,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:44:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024100994] [2025-03-04 14:44:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024100994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818319367] [2025-03-04 14:44:28,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:28,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:28,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:28,552 INFO L229 MonitoredProcess]: Starting monitored process 13 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:28,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 14:44:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:44:29,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:44:29,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:29,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:29,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 2080 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:29,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:44:29,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:44:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818319367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:29,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:44:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982640692] [2025-03-04 14:44:29,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:29,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:44:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:29,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:44:29,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:29,739 INFO L87 Difference]: Start difference. First operand 639 states and 851 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:29,848 INFO L93 Difference]: Finished difference Result 742 states and 962 transitions. [2025-03-04 14:44:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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 110 [2025-03-04 14:44:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:29,851 INFO L225 Difference]: With dead ends: 742 [2025-03-04 14:44:29,851 INFO L226 Difference]: Without dead ends: 741 [2025-03-04 14:44:29,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 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:44:29,851 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 0 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:29,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1911 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-04 14:44:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2025-03-04 14:44:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 682 states have (on average 1.3387096774193548) internal successors, (913), 711 states have internal predecessors, (913), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:44:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 959 transitions. [2025-03-04 14:44:29,874 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 959 transitions. Word has length 110 [2025-03-04 14:44:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:29,874 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 959 transitions. [2025-03-04 14:44:29,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 959 transitions. [2025-03-04 14:44:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 14:44:29,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:29,875 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 2, 2, 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:29,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:30,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 14:44:30,077 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-04 14:44:30,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1093423494, now seen corresponding path program 2 times [2025-03-04 14:44:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:30,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370787220] [2025-03-04 14:44:30,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:30,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 14:44:30,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 14:44:30,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:44:30,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 14:44:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370787220] [2025-03-04 14:44:30,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370787220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253069341] [2025-03-04 14:44:30,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:30,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:30,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:30,943 INFO L229 MonitoredProcess]: Starting monitored process 14 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:30,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 14:44:31,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes.