./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/echo-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/echo-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:00:54,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:00:55,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:00:55,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:00:55,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:00:55,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:00:55,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:00:55,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:00:55,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:00:55,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:00:55,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:00:55,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:00:55,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:00:55,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:00:55,050 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:00:55,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:00:55,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:00:55,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:00:55,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:00:55,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:00:55,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:00:55,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:00:55,052 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:00:55,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:00:55,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:00:55,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:00:55,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:00:55,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:00:55,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:55,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:55,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:55,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:00:55,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:00:55,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:00:55,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:00:55,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:00:55,055 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd [2025-01-10 06:00:55,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:00:55,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:00:55,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:00:55,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:00:55,358 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:00:55,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-01-10 06:00:56,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67733532b/5d98d580e67a48798be9fc8b3803ac27/FLAG0ef8dc057 [2025-01-10 06:00:57,109 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:00:57,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-01-10 06:00:57,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67733532b/5d98d580e67a48798be9fc8b3803ac27/FLAG0ef8dc057 [2025-01-10 06:00:57,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67733532b/5d98d580e67a48798be9fc8b3803ac27 [2025-01-10 06:00:57,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:00:57,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:00:57,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:57,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:00:57,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:00:57,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:57" (1/1) ... [2025-01-10 06:00:57,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aeedc53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:57, skipping insertion in model container [2025-01-10 06:00:57,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:57" (1/1) ... [2025-01-10 06:00:57,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:00:58,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:58,249 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:00:58,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:58,591 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:00:58,600 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:00:58,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58 WrapperNode [2025-01-10 06:00:58,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:58,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:58,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:00:58,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:00:58,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,747 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1055 [2025-01-10 06:00:58,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:58,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:00:58,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:00:58,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:00:58,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,785 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:00:58,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:00:58,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:00:58,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:00:58,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:00:58,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (1/1) ... [2025-01-10 06:00:58,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:58,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:58,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:00:58,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:00:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:00:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:00:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:00:58,946 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:00:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:00:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:00:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:00:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:00:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:00:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:00:58,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:00:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:00:58,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:00:58,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:00:58,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:00:58,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:00:58,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:00:58,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:00:58,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:00:58,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:00:58,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:00:58,949 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-01-10 06:00:58,949 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-01-10 06:00:58,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:00:59,261 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:00:59,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:01:04,289 INFO L? ?]: Removed 255 outVars from TransFormulas that were not future-live. [2025-01-10 06:01:04,290 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:01:04,306 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:01:04,306 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 06:01:04,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:04 BoogieIcfgContainer [2025-01-10 06:01:04,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:01:04,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:01:04,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:01:04,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:01:04,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:00:57" (1/3) ... [2025-01-10 06:01:04,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c00b4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:04, skipping insertion in model container [2025-01-10 06:01:04,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:58" (2/3) ... [2025-01-10 06:01:04,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c00b4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:04, skipping insertion in model container [2025-01-10 06:01:04,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:04" (3/3) ... [2025-01-10 06:01:04,316 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-1.i [2025-01-10 06:01:04,329 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:01:04,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-1.i that has 5 procedures, 212 locations, 1 initial locations, 19 loop locations, and 36 error locations. [2025-01-10 06:01:04,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:01:04,410 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;@40ec40ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:01:04,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-10 06:01:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 162 states have (on average 1.6728395061728396) internal successors, (271), 198 states have internal predecessors, (271), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 06:01:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:01:04,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:04,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:01:04,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 7636548, now seen corresponding path program 1 times [2025-01-10 06:01:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010870845] [2025-01-10 06:01:04,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:04,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:01:05,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:01:05,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:05,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:05,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:05,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010870845] [2025-01-10 06:01:05,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010870845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:05,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190098038] [2025-01-10 06:01:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:05,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:05,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:05,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:05,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:05,511 INFO L87 Difference]: Start difference. First operand has 212 states, 162 states have (on average 1.6728395061728396) internal successors, (271), 198 states have internal predecessors, (271), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-01-10 06:01:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:05,599 INFO L93 Difference]: Finished difference Result 348 states and 493 transitions. [2025-01-10 06:01:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:05,603 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-01-10 06:01:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:05,611 INFO L225 Difference]: With dead ends: 348 [2025-01-10 06:01:05,612 INFO L226 Difference]: Without dead ends: 137 [2025-01-10 06:01:05,617 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-01-10 06:01:05,623 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:05,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 349 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-10 06:01:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-10 06:01:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.4912280701754386) internal successors, (170), 129 states have internal predecessors, (170), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2025-01-10 06:01:05,678 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 4 [2025-01-10 06:01:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:05,678 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2025-01-10 06:01:05,679 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-01-10 06:01:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2025-01-10 06:01:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:01:05,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:05,679 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:01:05,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:01:05,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:05,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash -132609152, now seen corresponding path program 1 times [2025-01-10 06:01:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:05,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185445528] [2025-01-10 06:01:05,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:06,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:01:06,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:01:06,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:06,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:06,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185445528] [2025-01-10 06:01:06,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185445528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:06,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365599740] [2025-01-10 06:01:06,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:06,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:06,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:06,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:06,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:01:06,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:01:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:01:07,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:07,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:07,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:07,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365599740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:01:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080483354] [2025-01-10 06:01:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:07,114 INFO L87 Difference]: Start difference. First operand 137 states and 179 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-01-10 06:01:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:07,169 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2025-01-10 06:01:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:07,170 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-01-10 06:01:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:07,171 INFO L225 Difference]: With dead ends: 137 [2025-01-10 06:01:07,175 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 06:01:07,175 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-01-10 06:01:07,176 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:07,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 339 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 06:01:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-10 06:01:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.4824561403508771) internal successors, (169), 128 states have internal predecessors, (169), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2025-01-10 06:01:07,188 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 7 [2025-01-10 06:01:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:07,188 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2025-01-10 06:01:07,188 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-01-10 06:01:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2025-01-10 06:01:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:01:07,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:07,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:01:07,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:01:07,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:07,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:07,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash 184083842, now seen corresponding path program 1 times [2025-01-10 06:01:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642431669] [2025-01-10 06:01:07,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:07,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:07,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:01:07,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:01:07,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:07,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:01:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642431669] [2025-01-10 06:01:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642431669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353887928] [2025-01-10 06:01:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:07,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:07,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:07,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:07,916 INFO L87 Difference]: Start difference. First operand 136 states and 178 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-01-10 06:01:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:07,945 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2025-01-10 06:01:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:07,946 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-01-10 06:01:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:07,949 INFO L225 Difference]: With dead ends: 136 [2025-01-10 06:01:07,949 INFO L226 Difference]: Without dead ends: 135 [2025-01-10 06:01:07,950 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-01-10 06:01:07,950 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:07,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-10 06:01:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-01-10 06:01:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4821428571428572) internal successors, (166), 125 states have internal predecessors, (166), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2025-01-10 06:01:07,973 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 8 [2025-01-10 06:01:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:07,973 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2025-01-10 06:01:07,973 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-01-10 06:01:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2025-01-10 06:01:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:01:07,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:07,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:07,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:01:07,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:07,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash -130504928, now seen corresponding path program 1 times [2025-01-10 06:01:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:07,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620499337] [2025-01-10 06:01:07,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:08,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:01:08,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:01:08,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620499337] [2025-01-10 06:01:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620499337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381198116] [2025-01-10 06:01:08,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:08,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:08,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:01:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:01:09,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:01:09,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:09,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:09,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:09,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:01:09,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381198116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:09,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:09,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:01:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042394617] [2025-01-10 06:01:09,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:09,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:09,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:09,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:09,194 INFO L87 Difference]: Start difference. First operand 133 states and 175 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-01-10 06:01:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:09,234 INFO L93 Difference]: Finished difference Result 133 states and 175 transitions. [2025-01-10 06:01:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:09,235 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-01-10 06:01:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:09,236 INFO L225 Difference]: With dead ends: 133 [2025-01-10 06:01:09,236 INFO L226 Difference]: Without dead ends: 131 [2025-01-10 06:01:09,236 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-01-10 06:01:09,237 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 123 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:09,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 205 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-10 06:01:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-10 06:01:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 123 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2025-01-10 06:01:09,246 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 12 [2025-01-10 06:01:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:09,249 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2025-01-10 06:01:09,249 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-01-10 06:01:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2025-01-10 06:01:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:01:09,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:09,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:09,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:01:09,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:09,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:09,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 249314793, now seen corresponding path program 1 times [2025-01-10 06:01:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875384011] [2025-01-10 06:01:09,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:09,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:09,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:09,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:09,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875384011] [2025-01-10 06:01:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875384011] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:10,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783892995] [2025-01-10 06:01:10,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:10,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:10,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:10,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:10,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:01:10,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:10,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:10,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:10,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:10,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:10,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:10,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783892995] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:10,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:01:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851191251] [2025-01-10 06:01:10,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:10,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:10,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:10,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:10,791 INFO L87 Difference]: Start difference. First operand 131 states and 173 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-01-10 06:01:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:10,824 INFO L93 Difference]: Finished difference Result 265 states and 351 transitions. [2025-01-10 06:01:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:10,825 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-01-10 06:01:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:10,825 INFO L225 Difference]: With dead ends: 265 [2025-01-10 06:01:10,825 INFO L226 Difference]: Without dead ends: 140 [2025-01-10 06:01:10,826 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-01-10 06:01:10,826 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 4 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:10,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 503 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-10 06:01:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-10 06:01:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 132 states have internal predecessors, (173), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2025-01-10 06:01:10,836 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 13 [2025-01-10 06:01:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:10,836 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-01-10 06:01:10,837 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-01-10 06:01:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2025-01-10 06:01:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:01:10,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:10,837 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:10,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:01:11,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:11,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:11,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash 989840045, now seen corresponding path program 2 times [2025-01-10 06:01:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468421659] [2025-01-10 06:01:11,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:11,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:01:11,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:01:11,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:11,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:11,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:11,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468421659] [2025-01-10 06:01:11,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468421659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:11,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:11,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:11,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979810034] [2025-01-10 06:01:11,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:11,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:11,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:11,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:11,708 INFO L87 Difference]: Start difference. First operand 140 states and 182 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-01-10 06:01:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:11,774 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2025-01-10 06:01:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 06:01:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:11,776 INFO L225 Difference]: With dead ends: 140 [2025-01-10 06:01:11,776 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 06:01:11,776 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-01-10 06:01:11,777 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 122 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:11,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 513 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 06:01:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-10 06:01:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 130 states have internal predecessors, (171), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2025-01-10 06:01:11,785 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 22 [2025-01-10 06:01:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:11,786 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2025-01-10 06:01:11,786 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-01-10 06:01:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2025-01-10 06:01:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:01:11,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:11,787 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:11,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:01:11,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash 250662980, now seen corresponding path program 1 times [2025-01-10 06:01:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222881849] [2025-01-10 06:01:11,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:12,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:01:12,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:01:12,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:12,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222881849] [2025-01-10 06:01:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222881849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791431009] [2025-01-10 06:01:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:12,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:12,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:12,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:12,325 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:12,360 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2025-01-10 06:01:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 06:01:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:12,362 INFO L225 Difference]: With dead ends: 259 [2025-01-10 06:01:12,363 INFO L226 Difference]: Without dead ends: 141 [2025-01-10 06:01:12,363 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-01-10 06:01:12,365 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:12,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 329 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-10 06:01:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-01-10 06:01:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.403225806451613) internal successors, (174), 133 states have internal predecessors, (174), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2025-01-10 06:01:12,380 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 27 [2025-01-10 06:01:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:12,380 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2025-01-10 06:01:12,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2025-01-10 06:01:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:01:12,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:12,381 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-01-10 06:01:12,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:01:12,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:12,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1447011657, now seen corresponding path program 1 times [2025-01-10 06:01:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716800782] [2025-01-10 06:01:12,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:12,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:01:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:01:12,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:12,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:12,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:12,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716800782] [2025-01-10 06:01:12,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716800782] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:12,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265368664] [2025-01-10 06:01:12,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:12,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:12,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:12,941 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:12,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:01:13,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:01:13,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:01:13,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:13,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:13,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:01:13,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:01:13,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:01:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265368664] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:13,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:13,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:01:13,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38193990] [2025-01-10 06:01:13,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:13,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:01:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:13,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:01:13,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:01:13,940 INFO L87 Difference]: Start difference. First operand 141 states and 183 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-01-10 06:01:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:14,101 INFO L93 Difference]: Finished difference Result 284 states and 374 transitions. [2025-01-10 06:01:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:01:14,102 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-01-10 06:01:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:14,103 INFO L225 Difference]: With dead ends: 284 [2025-01-10 06:01:14,103 INFO L226 Difference]: Without dead ends: 158 [2025-01-10 06:01:14,104 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-01-10 06:01:14,104 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 5 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:14,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 797 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-10 06:01:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-01-10 06:01:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 150 states have internal predecessors, (191), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 200 transitions. [2025-01-10 06:01:14,118 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 200 transitions. Word has length 30 [2025-01-10 06:01:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:14,118 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 200 transitions. [2025-01-10 06:01:14,118 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-01-10 06:01:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2025-01-10 06:01:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:01:14,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:14,119 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:14,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:14,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:01:14,320 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:14,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash -983707913, now seen corresponding path program 1 times [2025-01-10 06:01:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:14,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945618991] [2025-01-10 06:01:14,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:14,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:14,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:01:14,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:01:14,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:14,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:01:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945618991] [2025-01-10 06:01:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945618991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201865592] [2025-01-10 06:01:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:14,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:14,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:14,847 INFO L87 Difference]: Start difference. First operand 158 states and 200 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-01-10 06:01:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:14,895 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2025-01-10 06:01:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:14,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:01:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:14,897 INFO L225 Difference]: With dead ends: 170 [2025-01-10 06:01:14,897 INFO L226 Difference]: Without dead ends: 168 [2025-01-10 06:01:14,897 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-01-10 06:01:14,898 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:14,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 324 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-10 06:01:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-01-10 06:01:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 151 states have (on average 1.3443708609271523) internal successors, (203), 159 states have internal predecessors, (203), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 212 transitions. [2025-01-10 06:01:14,913 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 212 transitions. Word has length 48 [2025-01-10 06:01:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:14,914 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 212 transitions. [2025-01-10 06:01:14,914 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-01-10 06:01:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 212 transitions. [2025-01-10 06:01:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:01:14,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:14,917 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-01-10 06:01:14,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:01:14,917 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:14,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -430179902, now seen corresponding path program 1 times [2025-01-10 06:01:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842579134] [2025-01-10 06:01:14,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:15,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:01:15,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:01:15,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:15,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:01:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842579134] [2025-01-10 06:01:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842579134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:15,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356832002] [2025-01-10 06:01:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:15,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:15,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:15,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:15,412 INFO L87 Difference]: Start difference. First operand 167 states and 212 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-01-10 06:01:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:15,434 INFO L93 Difference]: Finished difference Result 167 states and 212 transitions. [2025-01-10 06:01:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:15,435 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-01-10 06:01:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:15,436 INFO L225 Difference]: With dead ends: 167 [2025-01-10 06:01:15,436 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 06:01:15,436 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-01-10 06:01:15,437 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:15,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 06:01:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2025-01-10 06:01:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 154 states have internal predecessors, (197), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 206 transitions. [2025-01-10 06:01:15,445 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 206 transitions. Word has length 49 [2025-01-10 06:01:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:15,446 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 206 transitions. [2025-01-10 06:01:15,446 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-01-10 06:01:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2025-01-10 06:01:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:01:15,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:15,447 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-01-10 06:01:15,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:01:15,449 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:15,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2078625552, now seen corresponding path program 1 times [2025-01-10 06:01:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991876438] [2025-01-10 06:01:15,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:15,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:01:15,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:01:15,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:15,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:16,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991876438] [2025-01-10 06:01:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991876438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776721144] [2025-01-10 06:01:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:16,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:16,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:16,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:16,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:01:16,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:01:16,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:01:16,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:16,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:16,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:16,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:16,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:16,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776721144] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:16,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:16,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:01:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176514086] [2025-01-10 06:01:16,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:16,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:16,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:16,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:16,954 INFO L87 Difference]: Start difference. First operand 162 states and 206 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-01-10 06:01:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:17,005 INFO L93 Difference]: Finished difference Result 299 states and 389 transitions. [2025-01-10 06:01:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:17,006 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-01-10 06:01:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:17,007 INFO L225 Difference]: With dead ends: 299 [2025-01-10 06:01:17,009 INFO L226 Difference]: Without dead ends: 180 [2025-01-10 06:01:17,009 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-01-10 06:01:17,010 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 4 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:17,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 489 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-10 06:01:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-10 06:01:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 165 states have (on average 1.303030303030303) internal successors, (215), 172 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2025-01-10 06:01:17,021 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 55 [2025-01-10 06:01:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:17,022 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2025-01-10 06:01:17,022 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-01-10 06:01:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2025-01-10 06:01:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 06:01:17,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:17,024 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] [2025-01-10 06:01:17,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:17,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:01:17,229 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1732002637, now seen corresponding path program 1 times [2025-01-10 06:01:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586610977] [2025-01-10 06:01:17,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:17,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 06:01:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 06:01:17,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:17,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:17,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:17,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586610977] [2025-01-10 06:01:17,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586610977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:17,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:01:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835241763] [2025-01-10 06:01:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:17,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:17,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:17,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:17,634 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:17,648 INFO L93 Difference]: Finished difference Result 270 states and 343 transitions. [2025-01-10 06:01:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:17,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-01-10 06:01:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:17,650 INFO L225 Difference]: With dead ends: 270 [2025-01-10 06:01:17,650 INFO L226 Difference]: Without dead ends: 178 [2025-01-10 06:01:17,650 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-01-10 06:01:17,651 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:17,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-10 06:01:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-01-10 06:01:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 170 states have internal predecessors, (212), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 220 transitions. [2025-01-10 06:01:17,661 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 220 transitions. Word has length 57 [2025-01-10 06:01:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:17,662 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 220 transitions. [2025-01-10 06:01:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2025-01-10 06:01:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 06:01:17,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:17,665 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, 1, 1, 1, 1, 1] [2025-01-10 06:01:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:01:17,665 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:17,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1103633251, now seen corresponding path program 1 times [2025-01-10 06:01:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909382070] [2025-01-10 06:01:17,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:17,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 06:01:17,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 06:01:17,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:17,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:18,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909382070] [2025-01-10 06:01:18,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909382070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:18,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:18,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610637934] [2025-01-10 06:01:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:18,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:18,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:18,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:18,207 INFO L87 Difference]: Start difference. First operand 178 states and 220 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-10 06:01:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:18,236 INFO L93 Difference]: Finished difference Result 183 states and 225 transitions. [2025-01-10 06:01:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:18,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 67 [2025-01-10 06:01:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:18,238 INFO L225 Difference]: With dead ends: 183 [2025-01-10 06:01:18,239 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 06:01:18,239 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-01-10 06:01:18,239 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:18,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 318 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 06:01:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-10 06:01:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 173 states have internal predecessors, (215), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2025-01-10 06:01:18,250 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 67 [2025-01-10 06:01:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:18,250 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2025-01-10 06:01:18,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-10 06:01:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2025-01-10 06:01:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 06:01:18,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:18,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:18,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:01:18,252 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:18,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash -534842196, now seen corresponding path program 1 times [2025-01-10 06:01:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935435732] [2025-01-10 06:01:18,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:18,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 06:01:18,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 06:01:18,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:18,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935435732] [2025-01-10 06:01:18,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935435732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:18,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618755880] [2025-01-10 06:01:18,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:18,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:18,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:18,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:18,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:18,761 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:22,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:01:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:22,905 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2025-01-10 06:01:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:22,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2025-01-10 06:01:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:22,907 INFO L225 Difference]: With dead ends: 201 [2025-01-10 06:01:22,907 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 06:01:22,907 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-01-10 06:01:22,908 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:22,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-10 06:01:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 06:01:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-10 06:01:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.281437125748503) internal successors, (214), 173 states have internal predecessors, (214), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 222 transitions. [2025-01-10 06:01:22,920 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 222 transitions. Word has length 71 [2025-01-10 06:01:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:22,920 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 222 transitions. [2025-01-10 06:01:22,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 222 transitions. [2025-01-10 06:01:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 06:01:22,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:22,922 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-01-10 06:01:22,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:01:22,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:22,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:22,923 INFO L85 PathProgramCache]: Analyzing trace with hash -362944910, now seen corresponding path program 1 times [2025-01-10 06:01:22,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:22,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291926264] [2025-01-10 06:01:22,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:22,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:23,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 06:01:23,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 06:01:23,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:23,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291926264] [2025-01-10 06:01:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291926264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167270029] [2025-01-10 06:01:23,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:23,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:23,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:23,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:01:24,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 06:01:24,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 06:01:24,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:24,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:24,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:01:24,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:01:24,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167270029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-10 06:01:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222352139] [2025-01-10 06:01:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:24,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:24,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:24,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:24,375 INFO L87 Difference]: Start difference. First operand 181 states and 222 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-01-10 06:01:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:24,469 INFO L93 Difference]: Finished difference Result 260 states and 332 transitions. [2025-01-10 06:01:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 70 [2025-01-10 06:01:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:24,471 INFO L225 Difference]: With dead ends: 260 [2025-01-10 06:01:24,471 INFO L226 Difference]: Without dead ends: 249 [2025-01-10 06:01:24,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:24,472 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 87 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:24,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 607 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-10 06:01:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-01-10 06:01:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 233 states have (on average 1.3218884120171674) internal successors, (308), 240 states have internal predecessors, (308), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:01:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 319 transitions. [2025-01-10 06:01:24,489 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 319 transitions. Word has length 70 [2025-01-10 06:01:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:24,489 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 319 transitions. [2025-01-10 06:01:24,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-01-10 06:01:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 319 transitions. [2025-01-10 06:01:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 06:01:24,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:24,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:24,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:01:24,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 06:01:24,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:24,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash -941507545, now seen corresponding path program 1 times [2025-01-10 06:01:24,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:24,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825911354] [2025-01-10 06:01:24,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:24,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 06:01:24,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:01:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:25,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:25,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825911354] [2025-01-10 06:01:25,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825911354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:25,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:25,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:01:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281021266] [2025-01-10 06:01:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:25,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:25,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:25,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:25,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:25,174 INFO L87 Difference]: Start difference. First operand 249 states and 319 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:25,209 INFO L93 Difference]: Finished difference Result 252 states and 321 transitions. [2025-01-10 06:01:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:25,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2025-01-10 06:01:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:25,211 INFO L225 Difference]: With dead ends: 252 [2025-01-10 06:01:25,211 INFO L226 Difference]: Without dead ends: 249 [2025-01-10 06:01:25,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:25,212 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 14 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:25,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 616 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-10 06:01:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-01-10 06:01:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 233 states have (on average 1.3175965665236051) internal successors, (307), 240 states have internal predecessors, (307), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:01:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2025-01-10 06:01:25,222 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 73 [2025-01-10 06:01:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:25,223 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2025-01-10 06:01:25,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2025-01-10 06:01:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 06:01:25,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:25,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:25,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:01:25,224 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:25,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash -941505623, now seen corresponding path program 1 times [2025-01-10 06:01:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138650234] [2025-01-10 06:01:25,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:25,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 06:01:25,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:01:25,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:25,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138650234] [2025-01-10 06:01:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138650234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:25,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:25,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379302842] [2025-01-10 06:01:25,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:25,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:25,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:25,926 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:26,065 INFO L93 Difference]: Finished difference Result 262 states and 330 transitions. [2025-01-10 06:01:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:26,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2025-01-10 06:01:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:26,067 INFO L225 Difference]: With dead ends: 262 [2025-01-10 06:01:26,067 INFO L226 Difference]: Without dead ends: 233 [2025-01-10 06:01:26,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:26,068 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 35 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:26,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 372 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-10 06:01:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-01-10 06:01:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 226 states have internal predecessors, (290), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 297 transitions. [2025-01-10 06:01:26,080 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 297 transitions. Word has length 73 [2025-01-10 06:01:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:26,080 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 297 transitions. [2025-01-10 06:01:26,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 297 transitions. [2025-01-10 06:01:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 06:01:26,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:26,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:26,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:01:26,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash -684193996, now seen corresponding path program 1 times [2025-01-10 06:01:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:26,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526168875] [2025-01-10 06:01:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:26,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 06:01:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 06:01:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:26,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-10 06:01:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526168875] [2025-01-10 06:01:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526168875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:26,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:01:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991333804] [2025-01-10 06:01:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:26,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:26,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:26,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:26,610 INFO L87 Difference]: Start difference. First operand 233 states and 297 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:26,676 INFO L93 Difference]: Finished difference Result 260 states and 331 transitions. [2025-01-10 06:01:26,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:26,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2025-01-10 06:01:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:26,678 INFO L225 Difference]: With dead ends: 260 [2025-01-10 06:01:26,678 INFO L226 Difference]: Without dead ends: 246 [2025-01-10 06:01:26,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:26,679 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 4 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:26,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-10 06:01:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2025-01-10 06:01:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 231 states have (on average 1.3203463203463204) internal successors, (305), 237 states have internal predecessors, (305), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 314 transitions. [2025-01-10 06:01:26,689 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 314 transitions. Word has length 74 [2025-01-10 06:01:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:26,690 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 314 transitions. [2025-01-10 06:01:26,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 314 transitions. [2025-01-10 06:01:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 06:01:26,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:26,691 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, 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-01-10 06:01:26,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:01:26,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:26,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash 264822676, now seen corresponding path program 1 times [2025-01-10 06:01:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177560418] [2025-01-10 06:01:26,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:26,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 06:01:27,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 06:01:27,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-10 06:01:27,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:27,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177560418] [2025-01-10 06:01:27,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177560418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:01:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336329128] [2025-01-10 06:01:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:01:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:27,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:01:27,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:27,500 INFO L87 Difference]: Start difference. First operand 245 states and 314 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:27,623 INFO L93 Difference]: Finished difference Result 251 states and 321 transitions. [2025-01-10 06:01:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:01:27,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 75 [2025-01-10 06:01:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:27,625 INFO L225 Difference]: With dead ends: 251 [2025-01-10 06:01:27,625 INFO L226 Difference]: Without dead ends: 250 [2025-01-10 06:01:27,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:01:27,626 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:27,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 292 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-10 06:01:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2025-01-10 06:01:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 232 states have (on average 1.3189655172413792) internal successors, (306), 238 states have internal predecessors, (306), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:01:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 315 transitions. [2025-01-10 06:01:27,640 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 315 transitions. Word has length 75 [2025-01-10 06:01:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:27,640 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 315 transitions. [2025-01-10 06:01:27,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 315 transitions. [2025-01-10 06:01:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 06:01:27,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:27,641 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-01-10 06:01:27,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:01:27,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 33 more)] === [2025-01-10 06:01:27,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash 493307064, now seen corresponding path program 2 times [2025-01-10 06:01:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700821902] [2025-01-10 06:01:27,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:27,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 06:01:28,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:01:28,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:01:28,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-10 06:01:28,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:28,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700821902] [2025-01-10 06:01:28,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700821902] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:28,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94757657] [2025-01-10 06:01:28,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:28,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:28,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:28,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:28,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:01:29,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.