./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/busybox-1.22.0/wc-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/wc-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b8000edc920fe8a32bdc36b56c8860a94e8d6d6bafdb81a520b0f73a8e153aaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:30:49,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:30:50,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 08:30:50,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:30:50,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:30:50,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:30:50,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:30:50,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:30:50,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:30:50,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:30:50,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:30:50,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:30:50,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:30:50,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:30:50,077 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:30:50,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:30:50,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:30:50,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:30:50,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:30:50,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:30:50,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:30:50,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:30:50,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:30:50,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:30:50,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:30:50,079 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 ! call(reach_error())) ) 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 -> b8000edc920fe8a32bdc36b56c8860a94e8d6d6bafdb81a520b0f73a8e153aaa [2025-02-06 08:30:50,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:30:50,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:30:50,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:30:50,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:30:50,315 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:30:50,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-02-06 08:30:51,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f4f7f09/cfde3bfaa3c44161ba97ebd12c13a411/FLAG82d36818d [2025-02-06 08:30:51,794 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:30:51,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-02-06 08:30:51,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f4f7f09/cfde3bfaa3c44161ba97ebd12c13a411/FLAG82d36818d [2025-02-06 08:30:52,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f4f7f09/cfde3bfaa3c44161ba97ebd12c13a411 [2025-02-06 08:30:52,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:30:52,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:30:52,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:30:52,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:30:52,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:30:52,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:30:52" (1/1) ... [2025-02-06 08:30:52,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2598433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:52, skipping insertion in model container [2025-02-06 08:30:52,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:30:52" (1/1) ... [2025-02-06 08:30:52,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:30:52,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-02-06 08:30:52,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:30:52,819 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:30:52,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-02-06 08:30:52,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:30:53,056 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 08:30:53,062 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:30:53,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53 WrapperNode [2025-02-06 08:30:53,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:30:53,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:30:53,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:30:53,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:30:53,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,184 INFO L138 Inliner]: procedures = 577, calls = 806, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 2104 [2025-02-06 08:30:53,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:30:53,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:30:53,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:30:53,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:30:53,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,223 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 08:30:53,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:30:53,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:30:53,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:30:53,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:30:53,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (1/1) ... [2025-02-06 08:30:53,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:30:53,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:30:53,360 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-02-06 08:30:53,364 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-02-06 08:30:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:30:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 08:30:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 08:30:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 08:30:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 08:30:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 08:30:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:30:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:30:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 08:30:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:30:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:30:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 08:30:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 08:30:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 08:30:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 08:30:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 08:30:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 08:30:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-06 08:30:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-06 08:30:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-06 08:30:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-06 08:30:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 08:30:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 08:30:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:30:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 08:30:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 08:30:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 08:30:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 08:30:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 08:30:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:30:53,721 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:30:53,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:30:58,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2911: call ULTIMATE.dealloc(__main_~#counts~0#1.base, __main_~#counts~0#1.offset);havoc __main_~#counts~0#1.base, __main_~#counts~0#1.offset;call ULTIMATE.dealloc(__main_~#totals~0#1.base, __main_~#totals~0#1.offset);havoc __main_~#totals~0#1.base, __main_~#totals~0#1.offset; [2025-02-06 08:30:58,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: havoc getopt_long_#t~ret291#1; [2025-02-06 08:30:58,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: havoc __main_~return_value_ferror$2~0#1; [2025-02-06 08:30:58,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: havoc _IO_getc_#t~nondet262#1; [2025-02-06 08:30:58,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc fclose_if_not_stdin_#t~bitwise74#1; [2025-02-06 08:30:58,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-06 08:30:59,027 INFO L? ?]: Removed 578 outVars from TransFormulas that were not future-live. [2025-02-06 08:30:59,028 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:30:59,072 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:30:59,072 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:30:59,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:30:59 BoogieIcfgContainer [2025-02-06 08:30:59,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:30:59,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:30:59,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:30:59,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:30:59,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:30:52" (1/3) ... [2025-02-06 08:30:59,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caf06a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:30:59, skipping insertion in model container [2025-02-06 08:30:59,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:30:53" (2/3) ... [2025-02-06 08:30:59,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caf06a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:30:59, skipping insertion in model container [2025-02-06 08:30:59,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:30:59" (3/3) ... [2025-02-06 08:30:59,080 INFO L128 eAbstractionObserver]: Analyzing ICFG wc-2.i [2025-02-06 08:30:59,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:30:59,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wc-2.i that has 8 procedures, 455 locations, 1 initial locations, 33 loop locations, and 4 error locations. [2025-02-06 08:30:59,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:30:59,157 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;@423c0843, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:30:59,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 08:30:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 455 states, 421 states have (on average 1.5890736342042755) internal successors, (669), 427 states have internal predecessors, (669), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 08:30:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 08:30:59,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:30:59,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:30:59,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:30:59,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:30:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1778648047, now seen corresponding path program 1 times [2025-02-06 08:30:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:30:59,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119429065] [2025-02-06 08:30:59,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:30:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:30:59,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 08:30:59,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 08:30:59,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:30:59,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:31:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119429065] [2025-02-06 08:31:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119429065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168754941] [2025-02-06 08:31:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:00,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:00,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:00,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:00,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:00,167 INFO L87 Difference]: Start difference. First operand has 455 states, 421 states have (on average 1.5890736342042755) internal successors, (669), 427 states have internal predecessors, (669), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:00,353 INFO L93 Difference]: Finished difference Result 854 states and 1357 transitions. [2025-02-06 08:31:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-02-06 08:31:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:00,362 INFO L225 Difference]: With dead ends: 854 [2025-02-06 08:31:00,362 INFO L226 Difference]: Without dead ends: 401 [2025-02-06 08:31:00,366 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-02-06 08:31:00,367 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:00,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1142 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-06 08:31:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-02-06 08:31:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 374 states have (on average 1.5160427807486632) internal successors, (567), 381 states have internal predecessors, (567), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 598 transitions. [2025-02-06 08:31:00,408 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 598 transitions. Word has length 46 [2025-02-06 08:31:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:00,408 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 598 transitions. [2025-02-06 08:31:00,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 598 transitions. [2025-02-06 08:31:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 08:31:00,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:00,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:00,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:31:00,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:00,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1212807971, now seen corresponding path program 1 times [2025-02-06 08:31:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:00,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663069158] [2025-02-06 08:31:00,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:00,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 08:31:00,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 08:31:00,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:00,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:31:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663069158] [2025-02-06 08:31:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663069158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:31:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408603711] [2025-02-06 08:31:01,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:01,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:31:01,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:31:01,089 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-02-06 08:31:01,091 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-02-06 08:31:01,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 08:31:01,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 08:31:01,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:01,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:01,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:31:01,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:31:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:31:01,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:31:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:31:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408603711] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:31:01,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:31:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 08:31:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905967287] [2025-02-06 08:31:01,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:31:01,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:31:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:01,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:31:01,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:31:01,861 INFO L87 Difference]: Start difference. First operand 401 states and 598 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:31:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:02,041 INFO L93 Difference]: Finished difference Result 801 states and 1197 transitions. [2025-02-06 08:31:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:31:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-02-06 08:31:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:02,044 INFO L225 Difference]: With dead ends: 801 [2025-02-06 08:31:02,045 INFO L226 Difference]: Without dead ends: 404 [2025-02-06 08:31:02,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 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-02-06 08:31:02,048 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 0 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:02,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1709 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-06 08:31:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-02-06 08:31:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 377 states have (on average 1.5119363395225465) internal successors, (570), 384 states have internal predecessors, (570), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 601 transitions. [2025-02-06 08:31:02,071 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 601 transitions. Word has length 50 [2025-02-06 08:31:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:02,071 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 601 transitions. [2025-02-06 08:31:02,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:31:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 601 transitions. [2025-02-06 08:31:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 08:31:02,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:02,073 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:02,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 08:31:02,277 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-02-06 08:31:02,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1803687205, now seen corresponding path program 2 times [2025-02-06 08:31:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915141164] [2025-02-06 08:31:02,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:31:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:02,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-06 08:31:02,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 53 statements. [2025-02-06 08:31:02,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:31:02,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 08:31:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915141164] [2025-02-06 08:31:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915141164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:03,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:31:03,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107255081] [2025-02-06 08:31:03,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:03,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:31:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:03,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:31:03,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:31:03,019 INFO L87 Difference]: Start difference. First operand 404 states and 601 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:03,372 INFO L93 Difference]: Finished difference Result 918 states and 1387 transitions. [2025-02-06 08:31:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:31:03,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-02-06 08:31:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:03,375 INFO L225 Difference]: With dead ends: 918 [2025-02-06 08:31:03,375 INFO L226 Difference]: Without dead ends: 593 [2025-02-06 08:31:03,376 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-02-06 08:31:03,377 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1134 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:03,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1081 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:31:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-06 08:31:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 406. [2025-02-06 08:31:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 379 states have (on average 1.5092348284960422) internal successors, (572), 386 states have internal predecessors, (572), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 603 transitions. [2025-02-06 08:31:03,394 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 603 transitions. Word has length 53 [2025-02-06 08:31:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:03,394 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 603 transitions. [2025-02-06 08:31:03,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 603 transitions. [2025-02-06 08:31:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 08:31:03,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:03,395 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:03,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:31:03,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:03,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash 806614852, now seen corresponding path program 1 times [2025-02-06 08:31:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534424488] [2025-02-06 08:31:03,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:03,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 08:31:03,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 08:31:03,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:03,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 08:31:03,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534424488] [2025-02-06 08:31:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534424488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:03,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:03,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:31:03,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757555086] [2025-02-06 08:31:03,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:03,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:31:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:03,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:31:03,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:31:03,950 INFO L87 Difference]: Start difference. First operand 406 states and 603 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:04,269 INFO L93 Difference]: Finished difference Result 421 states and 617 transitions. [2025-02-06 08:31:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:31:04,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-02-06 08:31:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:04,275 INFO L225 Difference]: With dead ends: 421 [2025-02-06 08:31:04,275 INFO L226 Difference]: Without dead ends: 415 [2025-02-06 08:31:04,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:31:04,276 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 15 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:04,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2835 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:31:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-06 08:31:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2025-02-06 08:31:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 383 states have (on average 1.5039164490861618) internal successors, (576), 389 states have internal predecessors, (576), 19 states have call successors, (19), 9 states have call predecessors, (19), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 608 transitions. [2025-02-06 08:31:04,295 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 608 transitions. Word has length 53 [2025-02-06 08:31:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:04,296 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 608 transitions. [2025-02-06 08:31:04,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 608 transitions. [2025-02-06 08:31:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 08:31:04,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:04,299 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:04,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:31:04,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:04,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 806644643, now seen corresponding path program 1 times [2025-02-06 08:31:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824697565] [2025-02-06 08:31:04,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:04,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 08:31:04,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 08:31:04,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:04,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:31:04,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:04,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824697565] [2025-02-06 08:31:04,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824697565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:31:04,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240309801] [2025-02-06 08:31:04,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:04,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:31:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:31:04,927 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-02-06 08:31:04,928 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-02-06 08:31:05,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 08:31:05,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 08:31:05,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:05,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:05,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:31:05,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:31:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:31:05,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:31:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:31:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240309801] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:31:05,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:31:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 08:31:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485668098] [2025-02-06 08:31:05,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:31:05,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 08:31:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:05,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 08:31:05,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:31:05,807 INFO L87 Difference]: Start difference. First operand 411 states and 608 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:31:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:05,985 INFO L93 Difference]: Finished difference Result 821 states and 1220 transitions. [2025-02-06 08:31:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 08:31:05,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2025-02-06 08:31:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:05,988 INFO L225 Difference]: With dead ends: 821 [2025-02-06 08:31:05,988 INFO L226 Difference]: Without dead ends: 417 [2025-02-06 08:31:05,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:31:05,989 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 0 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:05,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2278 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-06 08:31:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-02-06 08:31:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 389 states have (on average 1.4961439588688945) internal successors, (582), 395 states have internal predecessors, (582), 19 states have call successors, (19), 9 states have call predecessors, (19), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 614 transitions. [2025-02-06 08:31:06,001 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 614 transitions. Word has length 53 [2025-02-06 08:31:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:06,002 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 614 transitions. [2025-02-06 08:31:06,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:31:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 614 transitions. [2025-02-06 08:31:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 08:31:06,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:06,003 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:06,013 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-02-06 08:31:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:31:06,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1332727971, now seen corresponding path program 2 times [2025-02-06 08:31:06,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:06,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789060237] [2025-02-06 08:31:06,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:31:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:06,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-06 08:31:06,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 59 statements. [2025-02-06 08:31:06,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:31:06,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:06,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789060237] [2025-02-06 08:31:06,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789060237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:06,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:06,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:06,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023148531] [2025-02-06 08:31:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:06,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:06,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:06,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:06,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:06,689 INFO L87 Difference]: Start difference. First operand 417 states and 614 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:06,788 INFO L93 Difference]: Finished difference Result 802 states and 1180 transitions. [2025-02-06 08:31:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-02-06 08:31:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:06,790 INFO L225 Difference]: With dead ends: 802 [2025-02-06 08:31:06,790 INFO L226 Difference]: Without dead ends: 421 [2025-02-06 08:31:06,791 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-02-06 08:31:06,791 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 21 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:06,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1112 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-06 08:31:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-02-06 08:31:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 392 states have (on average 1.489795918367347) internal successors, (584), 398 states have internal predecessors, (584), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2025-02-06 08:31:06,804 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 59 [2025-02-06 08:31:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:06,804 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2025-02-06 08:31:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2025-02-06 08:31:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:31:06,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:06,805 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:06,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:31:06,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:06,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash -555780914, now seen corresponding path program 1 times [2025-02-06 08:31:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367778467] [2025-02-06 08:31:06,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:06,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:31:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:31:07,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:07,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367778467] [2025-02-06 08:31:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367778467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:07,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:31:07,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268159565] [2025-02-06 08:31:07,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:07,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:31:07,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:07,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:31:07,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:31:07,401 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:07,601 INFO L93 Difference]: Finished difference Result 817 states and 1202 transitions. [2025-02-06 08:31:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:31:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-02-06 08:31:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:07,604 INFO L225 Difference]: With dead ends: 817 [2025-02-06 08:31:07,604 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 08:31:07,605 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-02-06 08:31:07,606 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:07,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1693 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:31:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 08:31:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-02-06 08:31:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 394 states have (on average 1.4873096446700507) internal successors, (586), 400 states have internal predecessors, (586), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 618 transitions. [2025-02-06 08:31:07,621 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 618 transitions. Word has length 67 [2025-02-06 08:31:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 618 transitions. [2025-02-06 08:31:07,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 618 transitions. [2025-02-06 08:31:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:31:07,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:07,622 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:07,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:31:07,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:07,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1739128211, now seen corresponding path program 1 times [2025-02-06 08:31:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759996042] [2025-02-06 08:31:07,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:07,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:07,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:31:07,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:31:07,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:07,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759996042] [2025-02-06 08:31:08,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759996042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:08,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:08,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:31:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154301500] [2025-02-06 08:31:08,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:08,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:31:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:08,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:31:08,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:31:08,136 INFO L87 Difference]: Start difference. First operand 423 states and 618 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:08,331 INFO L93 Difference]: Finished difference Result 822 states and 1209 transitions. [2025-02-06 08:31:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:31:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-02-06 08:31:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:08,335 INFO L225 Difference]: With dead ends: 822 [2025-02-06 08:31:08,335 INFO L226 Difference]: Without dead ends: 426 [2025-02-06 08:31:08,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 08:31:08,336 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:08,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2252 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:31:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-06 08:31:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-02-06 08:31:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 397 states have (on average 1.4811083123425692) internal successors, (588), 403 states have internal predecessors, (588), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2025-02-06 08:31:08,351 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 67 [2025-02-06 08:31:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:08,351 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2025-02-06 08:31:08,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2025-02-06 08:31:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:31:08,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:08,352 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:08,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:31:08,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:08,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash -850023152, now seen corresponding path program 1 times [2025-02-06 08:31:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011548500] [2025-02-06 08:31:08,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:08,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:31:08,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:31:08,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:08,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:08,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011548500] [2025-02-06 08:31:08,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011548500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:08,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:08,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:31:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141686267] [2025-02-06 08:31:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:08,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:31:08,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:08,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:31:08,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:31:08,829 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:09,002 INFO L93 Difference]: Finished difference Result 819 states and 1201 transitions. [2025-02-06 08:31:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:31:09,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2025-02-06 08:31:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:09,005 INFO L225 Difference]: With dead ends: 819 [2025-02-06 08:31:09,006 INFO L226 Difference]: Without dead ends: 428 [2025-02-06 08:31:09,007 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-02-06 08:31:09,008 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:09,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1693 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:31:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-06 08:31:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-02-06 08:31:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 405 states have internal predecessors, (590), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 622 transitions. [2025-02-06 08:31:09,022 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 622 transitions. Word has length 69 [2025-02-06 08:31:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:09,023 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 622 transitions. [2025-02-06 08:31:09,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 622 transitions. [2025-02-06 08:31:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:31:09,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:09,026 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:09,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:31:09,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:09,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1744203665, now seen corresponding path program 1 times [2025-02-06 08:31:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:09,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399416265] [2025-02-06 08:31:09,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:09,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:31:09,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:31:09,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:09,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399416265] [2025-02-06 08:31:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399416265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:09,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:31:09,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264093761] [2025-02-06 08:31:09,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:09,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:31:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:09,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:31:09,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:31:09,523 INFO L87 Difference]: Start difference. First operand 428 states and 622 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:09,779 INFO L93 Difference]: Finished difference Result 813 states and 1191 transitions. [2025-02-06 08:31:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:31:09,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2025-02-06 08:31:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:09,781 INFO L225 Difference]: With dead ends: 813 [2025-02-06 08:31:09,781 INFO L226 Difference]: Without dead ends: 430 [2025-02-06 08:31:09,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:31:09,782 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:09,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2817 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:31:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-06 08:31:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2025-02-06 08:31:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 405 states have internal predecessors, (590), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 622 transitions. [2025-02-06 08:31:09,794 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 622 transitions. Word has length 69 [2025-02-06 08:31:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:09,794 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 622 transitions. [2025-02-06 08:31:09,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 622 transitions. [2025-02-06 08:31:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:31:09,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:09,795 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:09,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:31:09,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:09,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1073529454, now seen corresponding path program 1 times [2025-02-06 08:31:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463812237] [2025-02-06 08:31:09,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:09,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:10,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:31:10,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:31:10,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:10,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463812237] [2025-02-06 08:31:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463812237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219121876] [2025-02-06 08:31:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:10,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:10,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:10,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:10,309 INFO L87 Difference]: Start difference. First operand 428 states and 622 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:10,438 INFO L93 Difference]: Finished difference Result 800 states and 1172 transitions. [2025-02-06 08:31:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2025-02-06 08:31:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:10,441 INFO L225 Difference]: With dead ends: 800 [2025-02-06 08:31:10,441 INFO L226 Difference]: Without dead ends: 429 [2025-02-06 08:31:10,442 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-02-06 08:31:10,444 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 0 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:10,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1134 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-06 08:31:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-02-06 08:31:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 400 states have (on average 1.4775) internal successors, (591), 406 states have internal predecessors, (591), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 623 transitions. [2025-02-06 08:31:10,460 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 623 transitions. Word has length 71 [2025-02-06 08:31:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:10,460 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 623 transitions. [2025-02-06 08:31:10,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 623 transitions. [2025-02-06 08:31:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:31:10,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:10,463 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:31:10,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:10,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1144228499, now seen corresponding path program 1 times [2025-02-06 08:31:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540387969] [2025-02-06 08:31:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:10,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:31:10,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:31:10,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:10,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:10,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540387969] [2025-02-06 08:31:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540387969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:10,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:10,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159402422] [2025-02-06 08:31:10,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:10,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:10,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:11,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:11,000 INFO L87 Difference]: Start difference. First operand 429 states and 623 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:11,111 INFO L93 Difference]: Finished difference Result 687 states and 1002 transitions. [2025-02-06 08:31:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2025-02-06 08:31:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:11,114 INFO L225 Difference]: With dead ends: 687 [2025-02-06 08:31:11,114 INFO L226 Difference]: Without dead ends: 357 [2025-02-06 08:31:11,114 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-02-06 08:31:11,115 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:11,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 936 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-06 08:31:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-02-06 08:31:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 330 states have (on average 1.4545454545454546) internal successors, (480), 336 states have internal predecessors, (480), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 510 transitions. [2025-02-06 08:31:11,124 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 510 transitions. Word has length 71 [2025-02-06 08:31:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:11,124 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 510 transitions. [2025-02-06 08:31:11,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 510 transitions. [2025-02-06 08:31:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 08:31:11,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:11,126 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:11,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:31:11,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:11,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash -738937245, now seen corresponding path program 1 times [2025-02-06 08:31:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696764457] [2025-02-06 08:31:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:11,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 08:31:11,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 08:31:11,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:11,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696764457] [2025-02-06 08:31:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696764457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:11,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:11,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066861120] [2025-02-06 08:31:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:11,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:11,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:11,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:11,478 INFO L87 Difference]: Start difference. First operand 357 states and 510 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:11,581 INFO L93 Difference]: Finished difference Result 610 states and 881 transitions. [2025-02-06 08:31:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:11,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2025-02-06 08:31:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:11,583 INFO L225 Difference]: With dead ends: 610 [2025-02-06 08:31:11,584 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 08:31:11,584 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-02-06 08:31:11,584 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 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-02-06 08:31:11,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 08:31:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-06 08:31:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 331 states have (on average 1.4531722054380665) internal successors, (481), 337 states have internal predecessors, (481), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:31:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 511 transitions. [2025-02-06 08:31:11,595 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 511 transitions. Word has length 75 [2025-02-06 08:31:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:11,595 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 511 transitions. [2025-02-06 08:31:11,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:31:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 511 transitions. [2025-02-06 08:31:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 08:31:11,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:11,596 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:31:11,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:31:11,597 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 301340454, now seen corresponding path program 1 times [2025-02-06 08:31:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451162746] [2025-02-06 08:31:11,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:11,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 08:31:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 08:31:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:11,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:11,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451162746] [2025-02-06 08:31:11,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451162746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:11,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085245610] [2025-02-06 08:31:11,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:11,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:11,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:11,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:11,959 INFO L87 Difference]: Start difference. First operand 358 states and 511 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:12,021 INFO L93 Difference]: Finished difference Result 593 states and 855 transitions. [2025-02-06 08:31:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:12,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2025-02-06 08:31:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:12,024 INFO L225 Difference]: With dead ends: 593 [2025-02-06 08:31:12,024 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 08:31:12,025 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-02-06 08:31:12,025 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 232 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:12,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 641 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 08:31:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-06 08:31:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 314 states have (on average 1.4458598726114649) internal successors, (454), 320 states have internal predecessors, (454), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:31:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 480 transitions. [2025-02-06 08:31:12,036 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 480 transitions. Word has length 76 [2025-02-06 08:31:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:12,036 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 480 transitions. [2025-02-06 08:31:12,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:31:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 480 transitions. [2025-02-06 08:31:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:31:12,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:12,037 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:12,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:31:12,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:12,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2090115321, now seen corresponding path program 1 times [2025-02-06 08:31:12,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:12,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425126950] [2025-02-06 08:31:12,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:12,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:31:12,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:31:12,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:12,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-06 08:31:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425126950] [2025-02-06 08:31:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425126950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:31:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926309521] [2025-02-06 08:31:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:12,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:31:12,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:12,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:31:12,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:31:12,698 INFO L87 Difference]: Start difference. First operand 338 states and 480 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:31:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:12,923 INFO L93 Difference]: Finished difference Result 750 states and 1091 transitions. [2025-02-06 08:31:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:31:12,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 89 [2025-02-06 08:31:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:12,927 INFO L225 Difference]: With dead ends: 750 [2025-02-06 08:31:12,927 INFO L226 Difference]: Without dead ends: 516 [2025-02-06 08:31:12,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:31:12,928 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 246 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:12,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1745 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:31:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-06 08:31:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 486. [2025-02-06 08:31:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 457 states have (on average 1.4551422319474836) internal successors, (665), 463 states have internal predecessors, (665), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:31:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 701 transitions. [2025-02-06 08:31:12,947 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 701 transitions. Word has length 89 [2025-02-06 08:31:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:12,947 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 701 transitions. [2025-02-06 08:31:12,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:31:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 701 transitions. [2025-02-06 08:31:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:31:12,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:12,950 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:31:12,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:12,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1243237958, now seen corresponding path program 1 times [2025-02-06 08:31:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076725737] [2025-02-06 08:31:12,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:13,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:31:13,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:31:13,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:13,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076725737] [2025-02-06 08:31:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076725737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:31:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687055108] [2025-02-06 08:31:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:31:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:13,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:31:13,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:31:13,864 INFO L87 Difference]: Start difference. First operand 486 states and 701 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-02-06 08:31:17,887 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-02-06 08:31:21,907 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-02-06 08:31:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:22,465 INFO L93 Difference]: Finished difference Result 656 states and 953 transitions. [2025-02-06 08:31:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:31:22,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 89 [2025-02-06 08:31:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:22,470 INFO L225 Difference]: With dead ends: 656 [2025-02-06 08:31:22,471 INFO L226 Difference]: Without dead ends: 564 [2025-02-06 08:31:22,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:31:22,472 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 529 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1810 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 290 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-02-06 08:31:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-06 08:31:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 499. [2025-02-06 08:31:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 468 states have (on average 1.452991452991453) internal successors, (680), 475 states have internal predecessors, (680), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (26), 17 states have call predecessors, (26), 17 states have call successors, (26) [2025-02-06 08:31:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 727 transitions. [2025-02-06 08:31:22,489 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 727 transitions. Word has length 89 [2025-02-06 08:31:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:22,489 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 727 transitions. [2025-02-06 08:31:22,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-02-06 08:31:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 727 transitions. [2025-02-06 08:31:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:31:22,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:22,490 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:22,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:31:22,491 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:22,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1748796583, now seen corresponding path program 1 times [2025-02-06 08:31:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662551391] [2025-02-06 08:31:22,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:22,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:31:22,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:31:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-06 08:31:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:22,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662551391] [2025-02-06 08:31:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662551391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:22,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:31:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324179407] [2025-02-06 08:31:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:22,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:31:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:22,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:31:22,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:31:22,994 INFO L87 Difference]: Start difference. First operand 499 states and 727 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 08:31:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:23,172 INFO L93 Difference]: Finished difference Result 844 states and 1244 transitions. [2025-02-06 08:31:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:31:23,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 89 [2025-02-06 08:31:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:23,175 INFO L225 Difference]: With dead ends: 844 [2025-02-06 08:31:23,176 INFO L226 Difference]: Without dead ends: 505 [2025-02-06 08:31:23,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 08:31:23,177 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 0 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:23,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1740 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:31:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-06 08:31:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501. [2025-02-06 08:31:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 470 states have (on average 1.451063829787234) internal successors, (682), 477 states have internal predecessors, (682), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (26), 17 states have call predecessors, (26), 17 states have call successors, (26) [2025-02-06 08:31:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 729 transitions. [2025-02-06 08:31:23,196 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 729 transitions. Word has length 89 [2025-02-06 08:31:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:23,197 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 729 transitions. [2025-02-06 08:31:23,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 08:31:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 729 transitions. [2025-02-06 08:31:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 08:31:23,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:23,198 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:31:23,198 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1780988067, now seen corresponding path program 1 times [2025-02-06 08:31:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101735280] [2025-02-06 08:31:23,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:23,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 08:31:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 08:31:23,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:23,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-06 08:31:23,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:23,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101735280] [2025-02-06 08:31:23,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101735280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:23,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:23,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399149740] [2025-02-06 08:31:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:23,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:23,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:23,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:23,717 INFO L87 Difference]: Start difference. First operand 501 states and 729 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:31:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:23,783 INFO L93 Difference]: Finished difference Result 635 states and 921 transitions. [2025-02-06 08:31:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:23,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 92 [2025-02-06 08:31:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:23,786 INFO L225 Difference]: With dead ends: 635 [2025-02-06 08:31:23,787 INFO L226 Difference]: Without dead ends: 507 [2025-02-06 08:31:23,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 08:31:23,788 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 210 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:23,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 647 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:31:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-06 08:31:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 499. [2025-02-06 08:31:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 468 states have (on average 1.4465811965811965) internal successors, (677), 475 states have internal predecessors, (677), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (26), 17 states have call predecessors, (26), 17 states have call successors, (26) [2025-02-06 08:31:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 724 transitions. [2025-02-06 08:31:23,808 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 724 transitions. Word has length 92 [2025-02-06 08:31:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:23,809 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 724 transitions. [2025-02-06 08:31:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:31:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 724 transitions. [2025-02-06 08:31:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 08:31:23,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:23,810 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:23,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:31:23,810 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:23,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash -84448099, now seen corresponding path program 1 times [2025-02-06 08:31:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405066276] [2025-02-06 08:31:23,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:24,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 08:31:24,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 08:31:24,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:24,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-06 08:31:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:24,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405066276] [2025-02-06 08:31:24,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405066276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:24,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:24,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:31:24,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908806435] [2025-02-06 08:31:24,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:24,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:31:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:24,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:31:24,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:31:24,279 INFO L87 Difference]: Start difference. First operand 499 states and 724 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 08:31:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:24,354 INFO L93 Difference]: Finished difference Result 623 states and 900 transitions. [2025-02-06 08:31:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:31:24,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 92 [2025-02-06 08:31:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:24,357 INFO L225 Difference]: With dead ends: 623 [2025-02-06 08:31:24,357 INFO L226 Difference]: Without dead ends: 499 [2025-02-06 08:31:24,357 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-02-06 08:31:24,357 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:24,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 871 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:31:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-06 08:31:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-02-06 08:31:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 468 states have (on average 1.4444444444444444) internal successors, (676), 475 states have internal predecessors, (676), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (26), 17 states have call predecessors, (26), 17 states have call successors, (26) [2025-02-06 08:31:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 723 transitions. [2025-02-06 08:31:24,372 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 723 transitions. Word has length 92 [2025-02-06 08:31:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:24,372 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 723 transitions. [2025-02-06 08:31:24,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 08:31:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 723 transitions. [2025-02-06 08:31:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 08:31:24,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:24,374 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:24,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:31:24,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:24,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1374353176, now seen corresponding path program 1 times [2025-02-06 08:31:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:24,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105168866] [2025-02-06 08:31:24,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:24,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 08:31:24,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 08:31:24,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:24,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105168866] [2025-02-06 08:31:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105168866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:31:25,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:31:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:31:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067464538] [2025-02-06 08:31:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:31:25,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:31:25,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:25,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:31:25,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:31:25,186 INFO L87 Difference]: Start difference. First operand 499 states and 723 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-02-06 08:31:29,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:31:33,236 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-02-06 08:31:37,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:31:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:31:37,916 INFO L93 Difference]: Finished difference Result 614 states and 880 transitions. [2025-02-06 08:31:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:31:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 93 [2025-02-06 08:31:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:31:37,919 INFO L225 Difference]: With dead ends: 614 [2025-02-06 08:31:37,919 INFO L226 Difference]: Without dead ends: 519 [2025-02-06 08:31:37,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:31:37,920 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 117 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:31:37,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1950 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 344 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-02-06 08:31:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-06 08:31:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 492. [2025-02-06 08:31:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 462 states have (on average 1.4437229437229437) internal successors, (667), 468 states have internal predecessors, (667), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2025-02-06 08:31:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 711 transitions. [2025-02-06 08:31:37,938 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 711 transitions. Word has length 93 [2025-02-06 08:31:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:31:37,939 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 711 transitions. [2025-02-06 08:31:37,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-02-06 08:31:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 711 transitions. [2025-02-06 08:31:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 08:31:37,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:31:37,940 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:31:37,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:31:37,940 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-06 08:31:37,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:31:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1210775489, now seen corresponding path program 1 times [2025-02-06 08:31:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:31:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973569406] [2025-02-06 08:31:37,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:31:38,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 08:31:38,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 08:31:38,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:38,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:31:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973569406] [2025-02-06 08:31:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973569406] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:31:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725020923] [2025-02-06 08:31:39,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:31:39,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:31:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:31:39,023 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-02-06 08:31:39,025 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-02-06 08:31:39,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 08:31:40,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 08:31:40,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:31:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:31:40,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 2201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 08:31:40,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:31:40,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 08:31:40,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 08:31:40,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 08:31:40,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:31:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 08:31:40,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:31:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725020923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:31:40,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 08:31:40,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-02-06 08:31:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998293415] [2025-02-06 08:31:40,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 08:31:40,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 08:31:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:31:40,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 08:31:40,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=280, Unknown=6, NotChecked=0, Total=342 [2025-02-06 08:31:40,664 INFO L87 Difference]: Start difference. First operand 492 states and 711 transitions. Second operand has 16 states, 16 states have (on average 9.4375) internal successors, (151), 16 states have internal predecessors, (151), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:31:44,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:31:48,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:31:52,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:31:56,742 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-02-06 08:32:00,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:32:04,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:32:08,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:32:12,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:32:16,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:32:20,881 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 []