./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/wc-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-798a7b3-m [2025-03-04 05:58:46,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:58:46,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:58:46,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:58:46,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:58:46,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:58:46,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:58:46,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:58:46,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:58:46,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:58:46,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:58:46,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:58:46,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:58:46,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:58:46,222 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:58:46,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:58:46,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:58:46,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:46,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:58:46,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:58:46,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:58:46,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:58:46,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:58:46,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:58:46,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:58:46,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:58:46,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:58:46,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:58:46,225 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-03-04 05:58:46,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:58:46,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:58:46,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:58:46,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:58:46,449 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:58:46,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-03-04 05:58:47,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b166a738/ccf59fa3e68a412ebd7d63cd8d4df394/FLAGaae6dc5e0 [2025-03-04 05:58:48,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:58:48,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-03-04 05:58:48,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b166a738/ccf59fa3e68a412ebd7d63cd8d4df394/FLAGaae6dc5e0 [2025-03-04 05:58:48,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b166a738/ccf59fa3e68a412ebd7d63cd8d4df394 [2025-03-04 05:58:48,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:58:48,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:58:48,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:48,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:58:48,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:58:48,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:48" (1/1) ... [2025-03-04 05:58:48,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:48, skipping insertion in model container [2025-03-04 05:58:48,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:48" (1/1) ... [2025-03-04 05:58:48,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:58:48,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-03-04 05:58:48,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:48,922 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:58:49,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-03-04 05:58:49,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:49,197 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 05:58:49,204 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:58:49,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49 WrapperNode [2025-03-04 05:58:49,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:49,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:49,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:58:49,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:58:49,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,339 INFO L138 Inliner]: procedures = 577, calls = 806, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 2104 [2025-03-04 05:58:49,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:49,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:58:49,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:58:49,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:58:49,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,369 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 05:58:49,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:58:49,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:58:49,487 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:58:49,488 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:58:49,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (1/1) ... [2025-03-04 05:58:49,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:58:49,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:58:49,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:58:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 05:58:49,540 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 05:58:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:58:49,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:58:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 05:58:49,541 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 05:58:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 05:58:49,541 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 05:58:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 05:58:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 05:58:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 05:58:49,541 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 05:58:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-04 05:58:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-04 05:58:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 05:58:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 05:58:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:58:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 05:58:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 05:58:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 05:58:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 05:58:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 05:58:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 05:58:49,903 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:58:49,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:58:55,116 INFO L1325 $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-03-04 05:58:55,116 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: havoc getopt_long_#t~ret291#1; [2025-03-04 05:58:55,116 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: havoc __main_~return_value_ferror$2~0#1; [2025-03-04 05:58:55,117 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: havoc _IO_getc_#t~nondet262#1; [2025-03-04 05:58:55,117 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc fclose_if_not_stdin_#t~bitwise74#1; [2025-03-04 05:58:55,117 INFO L1325 $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-03-04 05:58:55,292 INFO L? ?]: Removed 578 outVars from TransFormulas that were not future-live. [2025-03-04 05:58:55,294 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:58:55,332 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:58:55,332 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 05:58:55,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:55 BoogieIcfgContainer [2025-03-04 05:58:55,333 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:58:55,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:58:55,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:58:55,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:58:55,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:58:48" (1/3) ... [2025-03-04 05:58:55,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71974b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:55, skipping insertion in model container [2025-03-04 05:58:55,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:49" (2/3) ... [2025-03-04 05:58:55,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71974b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:55, skipping insertion in model container [2025-03-04 05:58:55,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:55" (3/3) ... [2025-03-04 05:58:55,340 INFO L128 eAbstractionObserver]: Analyzing ICFG wc-2.i [2025-03-04 05:58:55,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:58:55,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wc-2.i that has 8 procedures, 450 locations, 1 initial locations, 33 loop locations, and 4 error locations. [2025-03-04 05:58:55,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:58:55,419 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;@741a79cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:58:55,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 05:58:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 450 states, 416 states have (on average 1.5961538461538463) internal successors, (664), 422 states have internal predecessors, (664), 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-03-04 05:58:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 05:58:55,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:55,429 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] [2025-03-04 05:58:55,430 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-03-04 05:58:55,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash 360511651, now seen corresponding path program 1 times [2025-03-04 05:58:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:55,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062143153] [2025-03-04 05:58:55,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:55,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 05:58:56,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 05:58:56,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:56,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:56,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062143153] [2025-03-04 05:58:56,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062143153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:56,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:56,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:58:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532253492] [2025-03-04 05:58:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:56,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:58:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:56,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:58:56,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:58:56,469 INFO L87 Difference]: Start difference. First operand has 450 states, 416 states have (on average 1.5961538461538463) internal successors, (664), 422 states have internal predecessors, (664), 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 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-03-04 05:58:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:56,650 INFO L93 Difference]: Finished difference Result 845 states and 1348 transitions. [2025-03-04 05:58:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:58:56,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 44 [2025-03-04 05:58:56,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:56,661 INFO L225 Difference]: With dead ends: 845 [2025-03-04 05:58:56,661 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 05:58:56,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:58:56,666 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:56,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1134 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 05:58:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-04 05:58:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 370 states have (on average 1.5216216216216216) internal successors, (563), 377 states have internal predecessors, (563), 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-03-04 05:58:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 594 transitions. [2025-03-04 05:58:56,716 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 594 transitions. Word has length 44 [2025-03-04 05:58:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:56,717 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 594 transitions. [2025-03-04 05:58:56,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-03-04 05:58:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 594 transitions. [2025-03-04 05:58:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 05:58:56,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:56,720 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] [2025-03-04 05:58:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:58:56,721 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-03-04 05:58:56,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash -874229870, now seen corresponding path program 1 times [2025-03-04 05:58:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649194735] [2025-03-04 05:58:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:57,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 05:58:57,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 05:58:57,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:57,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:57,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649194735] [2025-03-04 05:58:57,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649194735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:58:57,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128159286] [2025-03-04 05:58:57,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:57,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:58:57,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:58:57,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:58:57,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:58:57,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 05:58:58,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 05:58:58,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:58,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:58,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1908 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 05:58:58,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:58:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:58,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:58:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128159286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:58:58,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:58:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 05:58:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613848071] [2025-03-04 05:58:58,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:58:58,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:58:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:58,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:58:58,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:58:58,220 INFO L87 Difference]: Start difference. First operand 397 states and 594 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-03-04 05:58:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:58,409 INFO L93 Difference]: Finished difference Result 793 states and 1189 transitions. [2025-03-04 05:58:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:58:58,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 48 [2025-03-04 05:58:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:58,411 INFO L225 Difference]: With dead ends: 793 [2025-03-04 05:58:58,412 INFO L226 Difference]: Without dead ends: 400 [2025-03-04 05:58:58,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:58:58,414 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 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-03-04 05:58:58,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-04 05:58:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-04 05:58:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 373 states have (on average 1.517426273458445) internal successors, (566), 380 states have internal predecessors, (566), 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-03-04 05:58:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 597 transitions. [2025-03-04 05:58:58,439 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 597 transitions. Word has length 48 [2025-03-04 05:58:58,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:58,439 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 597 transitions. [2025-03-04 05:58:58,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-03-04 05:58:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 597 transitions. [2025-03-04 05:58:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 05:58:58,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:58,443 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] [2025-03-04 05:58:58,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 05:58:58,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:58:58,644 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-03-04 05:58:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1831863179, now seen corresponding path program 2 times [2025-03-04 05:58:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144618944] [2025-03-04 05:58:58,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 05:58:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:58,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 05:58:58,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 51 statements. [2025-03-04 05:58:58,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 05:58:58,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 05:58:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144618944] [2025-03-04 05:58:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144618944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:59,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:58:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928896013] [2025-03-04 05:58:59,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:59,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:58:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:59,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:58:59,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:58:59,327 INFO L87 Difference]: Start difference. First operand 400 states and 597 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-03-04 05:58:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:59,661 INFO L93 Difference]: Finished difference Result 909 states and 1378 transitions. [2025-03-04 05:58:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:58:59,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 51 [2025-03-04 05:58:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:59,664 INFO L225 Difference]: With dead ends: 909 [2025-03-04 05:58:59,664 INFO L226 Difference]: Without dead ends: 588 [2025-03-04 05:58:59,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:58:59,665 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1115 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1087 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-03-04 05:58:59,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1087 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:58:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-04 05:58:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 401. [2025-03-04 05:58:59,678 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-03-04 05:58:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 598 transitions. [2025-03-04 05:58:59,680 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 598 transitions. Word has length 51 [2025-03-04 05:58:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:59,680 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 598 transitions. [2025-03-04 05:58:59,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-03-04 05:58:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 598 transitions. [2025-03-04 05:58:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 05:58:59,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:59,682 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] [2025-03-04 05:58:59,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:58:59,682 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-03-04 05:58:59,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:59,682 INFO L85 PathProgramCache]: Analyzing trace with hash -478553482, now seen corresponding path program 1 times [2025-03-04 05:58:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:59,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427144989] [2025-03-04 05:58:59,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:59,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 05:58:59,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 05:58:59,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:59,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 05:59:00,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:00,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427144989] [2025-03-04 05:59:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427144989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336462033] [2025-03-04 05:59:00,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:00,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:00,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:00,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:00,277 INFO L87 Difference]: Start difference. First operand 401 states and 598 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-03-04 05:59:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:00,533 INFO L93 Difference]: Finished difference Result 414 states and 610 transitions. [2025-03-04 05:59:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 51 [2025-03-04 05:59:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:00,536 INFO L225 Difference]: With dead ends: 414 [2025-03-04 05:59:00,536 INFO L226 Difference]: Without dead ends: 409 [2025-03-04 05:59:00,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 05:59:00,537 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 13 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2815 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:00,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2815 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-04 05:59:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2025-03-04 05:59:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 378 states have (on average 1.5105820105820107) internal successors, (571), 384 states have internal predecessors, (571), 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-03-04 05:59:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 603 transitions. [2025-03-04 05:59:00,555 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 603 transitions. Word has length 51 [2025-03-04 05:59:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:00,557 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 603 transitions. [2025-03-04 05:59:00,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-03-04 05:59:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 603 transitions. [2025-03-04 05:59:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 05:59:00,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:00,559 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] [2025-03-04 05:59:00,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:59:00,559 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-03-04 05:59:00,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash -478552521, now seen corresponding path program 1 times [2025-03-04 05:59:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:00,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844852323] [2025-03-04 05:59:00,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:00,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 05:59:00,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 05:59:00,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:00,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844852323] [2025-03-04 05:59:01,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844852323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002499716] [2025-03-04 05:59:01,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:01,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:01,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:01,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:01,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:59:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 05:59:01,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 05:59:01,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:01,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:01,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1953 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 05:59:01,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:01,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:59:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002499716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:59:01,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:59:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 05:59:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638610880] [2025-03-04 05:59:01,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:59:01,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 05:59:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:01,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 05:59:01,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 05:59:01,946 INFO L87 Difference]: Start difference. First operand 406 states and 603 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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-03-04 05:59:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:02,194 INFO L93 Difference]: Finished difference Result 811 states and 1210 transitions. [2025-03-04 05:59:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 05:59:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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 51 [2025-03-04 05:59:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:02,197 INFO L225 Difference]: With dead ends: 811 [2025-03-04 05:59:02,197 INFO L226 Difference]: Without dead ends: 412 [2025-03-04 05:59:02,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 05:59:02,198 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 2825 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:02,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3392 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-04 05:59:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-04 05:59:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 384 states have (on average 1.5026041666666667) internal successors, (577), 390 states have internal predecessors, (577), 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-03-04 05:59:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 609 transitions. [2025-03-04 05:59:02,214 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 609 transitions. Word has length 51 [2025-03-04 05:59:02,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:02,214 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 609 transitions. [2025-03-04 05:59:02,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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-03-04 05:59:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 609 transitions. [2025-03-04 05:59:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 05:59:02,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:02,215 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] [2025-03-04 05:59:02,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 05:59:02,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:02,416 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-03-04 05:59:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1041819369, now seen corresponding path program 2 times [2025-03-04 05:59:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720206757] [2025-03-04 05:59:02,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 05:59:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:02,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-04 05:59:02,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 57 statements. [2025-03-04 05:59:02,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 05:59:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:02,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720206757] [2025-03-04 05:59:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720206757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:02,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:02,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:02,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626207525] [2025-03-04 05:59:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:02,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:02,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:02,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:02,919 INFO L87 Difference]: Start difference. First operand 412 states and 609 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03-04 05:59:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:03,032 INFO L93 Difference]: Finished difference Result 792 states and 1170 transitions. [2025-03-04 05:59:03,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:03,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 57 [2025-03-04 05:59:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:03,034 INFO L225 Difference]: With dead ends: 792 [2025-03-04 05:59:03,035 INFO L226 Difference]: Without dead ends: 416 [2025-03-04 05:59:03,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:03,036 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 21 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1104 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-03-04 05:59:03,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-04 05:59:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-04 05:59:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 387 states have (on average 1.496124031007752) internal successors, (579), 393 states have internal predecessors, (579), 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-03-04 05:59:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 611 transitions. [2025-03-04 05:59:03,047 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 611 transitions. Word has length 57 [2025-03-04 05:59:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:03,047 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 611 transitions. [2025-03-04 05:59:03,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03-04 05:59:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 611 transitions. [2025-03-04 05:59:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 05:59:03,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:03,048 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] [2025-03-04 05:59:03,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:59:03,049 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-03-04 05:59:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash 880612032, now seen corresponding path program 1 times [2025-03-04 05:59:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366978940] [2025-03-04 05:59:03,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:03,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 05:59:03,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 05:59:03,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:03,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:03,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366978940] [2025-03-04 05:59:03,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366978940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:03,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:03,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542999689] [2025-03-04 05:59:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:03,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:03,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:03,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:03,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:03,602 INFO L87 Difference]: Start difference. First operand 416 states and 611 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03-04 05:59:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:03,771 INFO L93 Difference]: Finished difference Result 807 states and 1192 transitions. [2025-03-04 05:59:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:03,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 65 [2025-03-04 05:59:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:03,775 INFO L225 Difference]: With dead ends: 807 [2025-03-04 05:59:03,775 INFO L226 Difference]: Without dead ends: 418 [2025-03-04 05:59:03,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:03,776 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1681 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:03,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1681 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-04 05:59:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-04 05:59:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 389 states have (on average 1.493573264781491) internal successors, (581), 395 states have internal predecessors, (581), 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-03-04 05:59:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2025-03-04 05:59:03,792 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 65 [2025-03-04 05:59:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:03,792 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2025-03-04 05:59:03,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03-04 05:59:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2025-03-04 05:59:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 05:59:03,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:03,793 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] [2025-03-04 05:59:03,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:59:03,794 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-03-04 05:59:03,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -144081889, now seen corresponding path program 1 times [2025-03-04 05:59:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95452701] [2025-03-04 05:59:03,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:04,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 05:59:04,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 05:59:04,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:04,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95452701] [2025-03-04 05:59:04,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95452701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:04,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:59:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338172533] [2025-03-04 05:59:04,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:04,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:59:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:04,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:59:04,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:04,234 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-03-04 05:59:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:04,420 INFO L93 Difference]: Finished difference Result 812 states and 1199 transitions. [2025-03-04 05:59:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:59:04,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2025-03-04 05:59:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:04,422 INFO L225 Difference]: With dead ends: 812 [2025-03-04 05:59:04,422 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 05:59:04,424 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-03-04 05:59:04,425 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 0 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2236 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-03-04 05:59:04,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2236 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 05:59:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-04 05:59:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 392 states have (on average 1.4872448979591837) internal successors, (583), 398 states have internal predecessors, (583), 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-03-04 05:59:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 615 transitions. [2025-03-04 05:59:04,437 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 615 transitions. Word has length 65 [2025-03-04 05:59:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:04,437 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 615 transitions. [2025-03-04 05:59:04,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-03-04 05:59:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 615 transitions. [2025-03-04 05:59:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 05:59:04,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:04,438 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-03-04 05:59:04,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:59:04,439 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-03-04 05:59:04,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2079562466, now seen corresponding path program 1 times [2025-03-04 05:59:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839925113] [2025-03-04 05:59:04,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:04,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 05:59:04,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 05:59:04,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:04,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839925113] [2025-03-04 05:59:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839925113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:04,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:04,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:04,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308109169] [2025-03-04 05:59:04,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:04,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:04,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:04,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:04,898 INFO L87 Difference]: Start difference. First operand 421 states and 615 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-03-04 05:59:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:05,065 INFO L93 Difference]: Finished difference Result 809 states and 1191 transitions. [2025-03-04 05:59:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:05,065 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-03-04 05:59:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:05,067 INFO L225 Difference]: With dead ends: 809 [2025-03-04 05:59:05,067 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 05:59:05,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:05,069 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1681 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:05,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1681 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 05:59:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-04 05:59:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 394 states have (on average 1.484771573604061) internal successors, (585), 400 states have internal predecessors, (585), 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-03-04 05:59:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 617 transitions. [2025-03-04 05:59:05,081 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 617 transitions. Word has length 67 [2025-03-04 05:59:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:05,082 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 617 transitions. [2025-03-04 05:59:05,082 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-03-04 05:59:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 617 transitions. [2025-03-04 05:59:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 05:59:05,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:05,084 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-03-04 05:59:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:59:05,084 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-03-04 05:59:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1630865827, now seen corresponding path program 1 times [2025-03-04 05:59:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151149328] [2025-03-04 05:59:05,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:05,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 05:59:05,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 05:59:05,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:05,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151149328] [2025-03-04 05:59:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151149328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:05,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:05,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803771663] [2025-03-04 05:59:05,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:05,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:05,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:05,615 INFO L87 Difference]: Start difference. First operand 423 states and 617 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-03-04 05:59:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:05,868 INFO L93 Difference]: Finished difference Result 803 states and 1181 transitions. [2025-03-04 05:59:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:05,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-03-04 05:59:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:05,870 INFO L225 Difference]: With dead ends: 803 [2025-03-04 05:59:05,871 INFO L226 Difference]: Without dead ends: 425 [2025-03-04 05:59:05,872 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-03-04 05:59:05,873 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2797 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-03-04 05:59:05,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2797 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-04 05:59:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2025-03-04 05:59:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 394 states have (on average 1.484771573604061) internal successors, (585), 400 states have internal predecessors, (585), 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-03-04 05:59:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 617 transitions. [2025-03-04 05:59:05,887 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 617 transitions. Word has length 67 [2025-03-04 05:59:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:05,887 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 617 transitions. [2025-03-04 05:59:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-03-04 05:59:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 617 transitions. [2025-03-04 05:59:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 05:59:05,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:05,889 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-03-04 05:59:05,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:59:05,889 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-03-04 05:59:05,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2097463520, now seen corresponding path program 1 times [2025-03-04 05:59:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132210193] [2025-03-04 05:59:05,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:06,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 05:59:06,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 05:59:06,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:06,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:06,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:06,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132210193] [2025-03-04 05:59:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132210193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:06,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:06,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675986127] [2025-03-04 05:59:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:06,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:06,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:06,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:06,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:06,430 INFO L87 Difference]: Start difference. First operand 423 states and 617 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-03-04 05:59:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:06,549 INFO L93 Difference]: Finished difference Result 801 states and 1178 transitions. [2025-03-04 05:59:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:06,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-03-04 05:59:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:06,552 INFO L225 Difference]: With dead ends: 801 [2025-03-04 05:59:06,552 INFO L226 Difference]: Without dead ends: 424 [2025-03-04 05:59:06,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:06,553 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:06,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1127 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-04 05:59:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-03-04 05:59:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 395 states have (on average 1.4835443037974683) internal successors, (586), 401 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-03-04 05:59:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 618 transitions. [2025-03-04 05:59:06,567 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 618 transitions. Word has length 69 [2025-03-04 05:59:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:06,567 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 618 transitions. [2025-03-04 05:59:06,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-03-04 05:59:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 618 transitions. [2025-03-04 05:59:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 05:59:06,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:06,568 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-03-04 05:59:06,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:59:06,568 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-03-04 05:59:06,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1068104222, now seen corresponding path program 1 times [2025-03-04 05:59:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:06,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741709367] [2025-03-04 05:59:06,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:06,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 05:59:06,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 05:59:06,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:06,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741709367] [2025-03-04 05:59:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741709367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:07,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822992745] [2025-03-04 05:59:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:07,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:07,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:07,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:07,043 INFO L87 Difference]: Start difference. First operand 424 states and 618 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-03-04 05:59:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:07,128 INFO L93 Difference]: Finished difference Result 679 states and 994 transitions. [2025-03-04 05:59:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:07,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 69 [2025-03-04 05:59:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:07,130 INFO L225 Difference]: With dead ends: 679 [2025-03-04 05:59:07,130 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 05:59:07,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:07,132 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 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-03-04 05:59:07,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 05:59:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-04 05:59:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 326 states have (on average 1.460122699386503) internal successors, (476), 332 states have internal predecessors, (476), 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-03-04 05:59:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 506 transitions. [2025-03-04 05:59:07,145 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 506 transitions. Word has length 69 [2025-03-04 05:59:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:07,145 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 506 transitions. [2025-03-04 05:59:07,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-03-04 05:59:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 506 transitions. [2025-03-04 05:59:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 05:59:07,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:07,146 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] [2025-03-04 05:59:07,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:59:07,147 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-03-04 05:59:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1074979281, now seen corresponding path program 1 times [2025-03-04 05:59:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152089918] [2025-03-04 05:59:07,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:07,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 05:59:07,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 05:59:07,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:07,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:07,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152089918] [2025-03-04 05:59:07,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152089918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:07,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:07,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594098810] [2025-03-04 05:59:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:07,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:07,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:07,500 INFO L87 Difference]: Start difference. First operand 353 states and 506 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03-04 05:59:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:07,595 INFO L93 Difference]: Finished difference Result 603 states and 874 transitions. [2025-03-04 05:59:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:07,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 73 [2025-03-04 05:59:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:07,598 INFO L225 Difference]: With dead ends: 603 [2025-03-04 05:59:07,598 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 05:59:07,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:07,599 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 927 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-03-04 05:59:07,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 927 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 05:59:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 05:59:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 327 states have (on average 1.4587155963302751) internal successors, (477), 333 states have internal predecessors, (477), 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-03-04 05:59:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 507 transitions. [2025-03-04 05:59:07,610 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 507 transitions. Word has length 73 [2025-03-04 05:59:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:07,610 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 507 transitions. [2025-03-04 05:59:07,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03-04 05:59:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 507 transitions. [2025-03-04 05:59:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 05:59:07,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:07,611 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] [2025-03-04 05:59:07,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:59:07,612 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-03-04 05:59:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash 337879588, now seen corresponding path program 1 times [2025-03-04 05:59:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665546699] [2025-03-04 05:59:07,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:07,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 05:59:07,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 05:59:07,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:07,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:07,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665546699] [2025-03-04 05:59:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665546699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528721548] [2025-03-04 05:59:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:07,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:07,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:07,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:07,954 INFO L87 Difference]: Start difference. First operand 354 states and 507 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03-04 05:59:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:08,004 INFO L93 Difference]: Finished difference Result 586 states and 848 transitions. [2025-03-04 05:59:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 74 [2025-03-04 05:59:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:08,007 INFO L225 Difference]: With dead ends: 586 [2025-03-04 05:59:08,007 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 05:59:08,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:08,008 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 232 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 634 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:08,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 634 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:59:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 05:59:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-04 05:59:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 316 states have internal predecessors, (450), 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-03-04 05:59:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 476 transitions. [2025-03-04 05:59:08,018 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 476 transitions. Word has length 74 [2025-03-04 05:59:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:08,019 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 476 transitions. [2025-03-04 05:59:08,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03-04 05:59:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 476 transitions. [2025-03-04 05:59:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 05:59:08,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:08,020 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] [2025-03-04 05:59:08,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:59:08,021 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-03-04 05:59:08,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1061476327, now seen corresponding path program 1 times [2025-03-04 05:59:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:08,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147695037] [2025-03-04 05:59:08,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:08,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 05:59:08,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 05:59:08,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:08,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 05:59:08,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147695037] [2025-03-04 05:59:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147695037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:08,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:08,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691492668] [2025-03-04 05:59:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:08,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:08,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:08,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:08,401 INFO L87 Difference]: Start difference. First operand 334 states and 476 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-04 05:59:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:08,502 INFO L93 Difference]: Finished difference Result 600 states and 869 transitions. [2025-03-04 05:59:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 87 [2025-03-04 05:59:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:08,505 INFO L225 Difference]: With dead ends: 600 [2025-03-04 05:59:08,505 INFO L226 Difference]: Without dead ends: 498 [2025-03-04 05:59:08,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:08,506 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 212 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 913 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-03-04 05:59:08,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 913 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-04 05:59:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 493. [2025-03-04 05:59:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 465 states have (on average 1.4752688172043011) internal successors, (686), 471 states have internal predecessors, (686), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 05:59:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 720 transitions. [2025-03-04 05:59:08,524 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 720 transitions. Word has length 87 [2025-03-04 05:59:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:08,524 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 720 transitions. [2025-03-04 05:59:08,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-04 05:59:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 720 transitions. [2025-03-04 05:59:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 05:59:08,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:08,525 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] [2025-03-04 05:59:08,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:59:08,526 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-03-04 05:59:08,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2086170248, now seen corresponding path program 1 times [2025-03-04 05:59:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254381699] [2025-03-04 05:59:08,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:08,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 05:59:08,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 05:59:08,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:08,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 05:59:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254381699] [2025-03-04 05:59:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254381699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:09,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:09,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138019532] [2025-03-04 05:59:09,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:09,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:09,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:09,244 INFO L87 Difference]: Start difference. First operand 493 states and 720 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-03-04 05:59:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:09,467 INFO L93 Difference]: Finished difference Result 1174 states and 1753 transitions. [2025-03-04 05:59:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 05:59:09,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 87 [2025-03-04 05:59:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:09,471 INFO L225 Difference]: With dead ends: 1174 [2025-03-04 05:59:09,471 INFO L226 Difference]: Without dead ends: 832 [2025-03-04 05:59:09,473 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-03-04 05:59:09,474 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 246 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1729 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-03-04 05:59:09,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1729 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-04 05:59:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 779. [2025-03-04 05:59:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 742 states have (on average 1.4784366576819408) internal successors, (1097), 748 states have internal predecessors, (1097), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 05:59:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1149 transitions. [2025-03-04 05:59:09,497 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1149 transitions. Word has length 87 [2025-03-04 05:59:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:09,497 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1149 transitions. [2025-03-04 05:59:09,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-03-04 05:59:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1149 transitions. [2025-03-04 05:59:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 05:59:09,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:09,499 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] [2025-03-04 05:59:09,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:59:09,499 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-03-04 05:59:09,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2117190055, now seen corresponding path program 1 times [2025-03-04 05:59:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022838126] [2025-03-04 05:59:09,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:09,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:09,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 05:59:09,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 05:59:09,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:09,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022838126] [2025-03-04 05:59:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022838126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:10,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:10,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:10,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071992156] [2025-03-04 05:59:10,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:10,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:10,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:10,284 INFO L87 Difference]: Start difference. First operand 779 states and 1149 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 05:59:14,317 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-03-04 05:59:18,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:59:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:18,737 INFO L93 Difference]: Finished difference Result 945 states and 1401 transitions. [2025-03-04 05:59:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:18,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 87 [2025-03-04 05:59:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:18,744 INFO L225 Difference]: With dead ends: 945 [2025-03-04 05:59:18,745 INFO L226 Difference]: Without dead ends: 856 [2025-03-04 05:59:18,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:18,746 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 600 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:18,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1588 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 257 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-04 05:59:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-04 05:59:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 792. [2025-03-04 05:59:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 753 states have (on average 1.4767596281540505) internal successors, (1112), 760 states have internal predecessors, (1112), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-04 05:59:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1179 transitions. [2025-03-04 05:59:18,769 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1179 transitions. Word has length 87 [2025-03-04 05:59:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:18,770 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1179 transitions. [2025-03-04 05:59:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 05:59:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1179 transitions. [2025-03-04 05:59:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 05:59:18,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:18,771 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] [2025-03-04 05:59:18,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 05:59:18,772 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-03-04 05:59:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1823787048, now seen corresponding path program 1 times [2025-03-04 05:59:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898738991] [2025-03-04 05:59:18,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:19,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 05:59:19,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 05:59:19,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:19,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 05:59:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:19,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898738991] [2025-03-04 05:59:19,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898738991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:19,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:19,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:59:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872855404] [2025-03-04 05:59:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:19,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:59:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:19,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:59:19,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:19,237 INFO L87 Difference]: Start difference. First operand 792 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 05:59:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:19,352 INFO L93 Difference]: Finished difference Result 1343 states and 2025 transitions. [2025-03-04 05:59:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:59:19,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 87 [2025-03-04 05:59:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:19,356 INFO L225 Difference]: With dead ends: 1343 [2025-03-04 05:59:19,356 INFO L226 Difference]: Without dead ends: 804 [2025-03-04 05:59:19,357 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-03-04 05:59:19,357 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 0 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1724 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:19,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1724 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-04 05:59:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2025-03-04 05:59:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 757 states have (on average 1.4742404227212682) internal successors, (1116), 764 states have internal predecessors, (1116), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-04 05:59:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1183 transitions. [2025-03-04 05:59:19,381 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1183 transitions. Word has length 87 [2025-03-04 05:59:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:19,381 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1183 transitions. [2025-03-04 05:59:19,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 05:59:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1183 transitions. [2025-03-04 05:59:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 05:59:19,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:19,383 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] [2025-03-04 05:59:19,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:59:19,383 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-03-04 05:59:19,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1260584967, now seen corresponding path program 1 times [2025-03-04 05:59:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:19,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694774140] [2025-03-04 05:59:19,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:19,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 05:59:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 05:59:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 05:59:19,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:19,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694774140] [2025-03-04 05:59:19,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694774140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:19,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233477425] [2025-03-04 05:59:19,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:19,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:19,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:19,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:19,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:19,823 INFO L87 Difference]: Start difference. First operand 796 states and 1183 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-03-04 05:59:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:19,883 INFO L93 Difference]: Finished difference Result 924 states and 1368 transitions. [2025-03-04 05:59:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 90 [2025-03-04 05:59:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:19,886 INFO L225 Difference]: With dead ends: 924 [2025-03-04 05:59:19,886 INFO L226 Difference]: Without dead ends: 798 [2025-03-04 05:59:19,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:19,887 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:19,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 871 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:59:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-04 05:59:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2025-03-04 05:59:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 759 states have (on average 1.4729907773386035) internal successors, (1118), 766 states have internal predecessors, (1118), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-04 05:59:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1185 transitions. [2025-03-04 05:59:19,909 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1185 transitions. Word has length 90 [2025-03-04 05:59:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:19,911 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1185 transitions. [2025-03-04 05:59:19,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-03-04 05:59:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1185 transitions. [2025-03-04 05:59:19,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 05:59:19,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:19,912 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] [2025-03-04 05:59:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 05:59:19,912 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-03-04 05:59:19,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash 731621112, now seen corresponding path program 1 times [2025-03-04 05:59:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:19,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095762692] [2025-03-04 05:59:19,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:20,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 05:59:20,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 05:59:20,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 05:59:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095762692] [2025-03-04 05:59:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095762692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:20,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852874102] [2025-03-04 05:59:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:20,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:20,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:20,373 INFO L87 Difference]: Start difference. First operand 798 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-03-04 05:59:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:20,428 INFO L93 Difference]: Finished difference Result 931 states and 1376 transitions. [2025-03-04 05:59:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:20,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 90 [2025-03-04 05:59:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:20,431 INFO L225 Difference]: With dead ends: 931 [2025-03-04 05:59:20,431 INFO L226 Difference]: Without dead ends: 797 [2025-03-04 05:59:20,431 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-03-04 05:59:20,431 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 202 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:20,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 640 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:59:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-04 05:59:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 792. [2025-03-04 05:59:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 753 states have (on average 1.4661354581673307) internal successors, (1104), 760 states have internal predecessors, (1104), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-04 05:59:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1171 transitions. [2025-03-04 05:59:20,450 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1171 transitions. Word has length 90 [2025-03-04 05:59:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:20,451 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1171 transitions. [2025-03-04 05:59:20,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-03-04 05:59:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1171 transitions. [2025-03-04 05:59:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 05:59:20,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:20,452 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] [2025-03-04 05:59:20,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 05:59:20,453 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-03-04 05:59:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash -252492904, now seen corresponding path program 1 times [2025-03-04 05:59:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087032554] [2025-03-04 05:59:20,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:20,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 05:59:20,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 05:59:20,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:20,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:21,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087032554] [2025-03-04 05:59:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087032554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:21,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:21,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561022347] [2025-03-04 05:59:21,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:21,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:21,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:21,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:21,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:21,173 INFO L87 Difference]: Start difference. First operand 792 states and 1171 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 05:59:25,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:59:29,200 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-03-04 05:59:33,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:59:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:33,773 INFO L93 Difference]: Finished difference Result 903 states and 1324 transitions. [2025-03-04 05:59:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:33,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 91 [2025-03-04 05:59:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:33,776 INFO L225 Difference]: With dead ends: 903 [2025-03-04 05:59:33,776 INFO L226 Difference]: Without dead ends: 811 [2025-03-04 05:59:33,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:33,777 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 115 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1927 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:33,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1927 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 344 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-03-04 05:59:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-04 05:59:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 785. [2025-03-04 05:59:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 747 states have (on average 1.465863453815261) internal successors, (1095), 753 states have internal predecessors, (1095), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (36), 25 states have call predecessors, (36), 24 states have call successors, (36) [2025-03-04 05:59:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1159 transitions. [2025-03-04 05:59:33,794 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1159 transitions. Word has length 91 [2025-03-04 05:59:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:33,794 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1159 transitions. [2025-03-04 05:59:33,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 05:59:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1159 transitions. [2025-03-04 05:59:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 05:59:33,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:33,796 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-03-04 05:59:33,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 05:59:33,796 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-04 05:59:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1450791825, now seen corresponding path program 1 times [2025-03-04 05:59:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124369040] [2025-03-04 05:59:33,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:34,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 05:59:34,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 05:59:34,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:34,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124369040] [2025-03-04 05:59:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124369040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544699508] [2025-03-04 05:59:35,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:35,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:35,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:35,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 05:59:35,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 05:59:35,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 05:59:35,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:35,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:35,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 2194 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 05:59:35,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:36,357 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-03-04 05:59:36,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 05:59:36,415 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-03-04 05:59:36,438 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-03-04 05:59:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 05:59:36,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:59:36,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544699508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:36,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 05:59:36,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-03-04 05:59:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242994936] [2025-03-04 05:59:36,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 05:59:36,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 05:59:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:36,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 05:59:36,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=285, Unknown=1, NotChecked=0, Total=342 [2025-03-04 05:59:36,617 INFO L87 Difference]: Start difference. First operand 785 states and 1159 transitions. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-03-04 05:59:40,645 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-03-04 05:59:44,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:59:48,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:59:52,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:59:56,736 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-03-04 06:00:00,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 06:00:04,782 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-03-04 06:00:08,786 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-03-04 06:00:12,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 06:00:16,869 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 []