./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:05:39,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:05:39,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:05:39,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:05:39,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:05:39,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:05:39,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:05:39,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:05:39,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:05:39,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:05:39,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:05:39,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:05:39,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:05:39,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:05:39,296 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:05:39,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:05:39,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:05:39,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:05:39,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:05:39,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:05:39,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:05:39,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:05:39,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:05:39,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:05:39,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:39,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:05:39,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:05:39,300 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 [2025-03-08 17:05:39,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:05:39,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:05:39,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:05:39,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:05:39,517 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:05:39,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2025-03-08 17:05:41,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97a16b6f/373d36975c8e4d9a9751ea3b7830024b/FLAG6e43bf085 [2025-03-08 17:05:41,581 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:05:41,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2025-03-08 17:05:41,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97a16b6f/373d36975c8e4d9a9751ea3b7830024b/FLAG6e43bf085 [2025-03-08 17:05:41,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97a16b6f/373d36975c8e4d9a9751ea3b7830024b [2025-03-08 17:05:41,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:05:41,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:05:41,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:41,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:05:41,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:05:41,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4962ca68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41, skipping insertion in model container [2025-03-08 17:05:41,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:05:41,740 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2025-03-08 17:05:41,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:41,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:05:41,829 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2025-03-08 17:05:41,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:41,895 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:05:41,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41 WrapperNode [2025-03-08 17:05:41,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:41,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:41,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:05:41,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:05:41,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,955 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2025-03-08 17:05:41,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:41,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:05:41,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:05:41,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:05:41,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,995 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-08 17:05:41,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:41,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:42,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:42,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:42,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:42,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:42,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:05:42,030 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:05:42,030 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:05:42,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:05:42,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (1/1) ... [2025-03-08 17:05:42,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:42,058 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-08 17:05:42,060 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-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:05:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:05:42,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:05:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:05:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:05:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:05:42,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:05:42,164 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:05:42,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:05:42,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-08 17:05:42,646 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-08 17:05:42,647 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:05:42,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:05:42,654 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:05:42,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:42 BoogieIcfgContainer [2025-03-08 17:05:42,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:05:42,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:05:42,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:05:42,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:05:42,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:05:41" (1/3) ... [2025-03-08 17:05:42,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7af8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:42, skipping insertion in model container [2025-03-08 17:05:42,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:41" (2/3) ... [2025-03-08 17:05:42,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7af8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:42, skipping insertion in model container [2025-03-08 17:05:42,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:42" (3/3) ... [2025-03-08 17:05:42,661 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-71.i [2025-03-08 17:05:42,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:05:42,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:05:42,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:05:42,725 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;@19aee8db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:05:42,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:05:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 17:05:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 17:05:42,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:42,737 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:42,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:42,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:42,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1033032455, now seen corresponding path program 1 times [2025-03-08 17:05:42,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156707121] [2025-03-08 17:05:42,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:42,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 17:05:42,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 17:05:42,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:42,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 17:05:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156707121] [2025-03-08 17:05:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156707121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443222836] [2025-03-08 17:05:43,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:43,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:43,029 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-08 17:05:43,030 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-08 17:05:43,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 17:05:43,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 17:05:43,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:43,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:43,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:05:43,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 17:05:43,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443222836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:05:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164502347] [2025-03-08 17:05:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:43,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:05:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:43,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:05:43,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:43,258 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 17:05:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:43,276 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-03-08 17:05:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:05:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-03-08 17:05:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:43,282 INFO L225 Difference]: With dead ends: 202 [2025-03-08 17:05:43,282 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 17:05:43,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:43,286 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:43,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 17:05:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 17:05:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 17:05:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-08 17:05:43,313 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-03-08 17:05:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:43,313 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-08 17:05:43,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 17:05:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-08 17:05:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 17:05:43,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:43,315 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:43,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:05:43,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 17:05:43,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:43,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash -611693478, now seen corresponding path program 1 times [2025-03-08 17:05:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744452176] [2025-03-08 17:05:43,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:43,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 17:05:43,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 17:05:43,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:43,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744452176] [2025-03-08 17:05:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744452176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:05:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934798929] [2025-03-08 17:05:43,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:43,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:43,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:43,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:43,802 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:43,832 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-03-08 17:05:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:43,833 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-08 17:05:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:43,834 INFO L225 Difference]: With dead ends: 202 [2025-03-08 17:05:43,834 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 17:05:43,835 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-08 17:05:43,835 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:43,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 17:05:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-08 17:05:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 17:05:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-03-08 17:05:43,844 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2025-03-08 17:05:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:43,845 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-03-08 17:05:43,845 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-03-08 17:05:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 17:05:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:43,852 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:43,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:05:43,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:43,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash 275810203, now seen corresponding path program 1 times [2025-03-08 17:05:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475218961] [2025-03-08 17:05:43,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:43,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 17:05:43,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 17:05:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:44,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475218961] [2025-03-08 17:05:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475218961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:44,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:05:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228345499] [2025-03-08 17:05:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:44,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:44,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:44,068 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:44,100 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2025-03-08 17:05:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:44,101 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-08 17:05:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:44,102 INFO L225 Difference]: With dead ends: 206 [2025-03-08 17:05:44,102 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 17:05:44,103 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-08 17:05:44,103 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:44,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 17:05:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-08 17:05:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 17:05:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-03-08 17:05:44,110 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2025-03-08 17:05:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:44,110 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-03-08 17:05:44,111 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-03-08 17:05:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 17:05:44,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:44,112 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:44,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:05:44,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:44,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash 276733724, now seen corresponding path program 1 times [2025-03-08 17:05:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545692718] [2025-03-08 17:05:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:44,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 17:05:44,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 17:05:44,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:44,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545692718] [2025-03-08 17:05:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545692718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:05:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402827024] [2025-03-08 17:05:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:05:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:45,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:05:45,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:05:45,246 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:45,599 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2025-03-08 17:05:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:45,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-08 17:05:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:45,601 INFO L225 Difference]: With dead ends: 254 [2025-03-08 17:05:45,601 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 17:05:45,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:05:45,602 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 230 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:45,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 370 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:05:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 17:05:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2025-03-08 17:05:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 17:05:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-08 17:05:45,611 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 144 [2025-03-08 17:05:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:45,612 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-08 17:05:45,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-08 17:05:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 17:05:45,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:45,613 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:05:45,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash 773821766, now seen corresponding path program 1 times [2025-03-08 17:05:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680072219] [2025-03-08 17:05:45,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:45,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 17:05:45,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 17:05:45,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:45,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680072219] [2025-03-08 17:05:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680072219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:46,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:46,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:05:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382988900] [2025-03-08 17:05:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:46,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:05:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:46,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:05:46,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:46,117 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:46,370 INFO L93 Difference]: Finished difference Result 233 states and 331 transitions. [2025-03-08 17:05:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:05:46,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2025-03-08 17:05:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:46,372 INFO L225 Difference]: With dead ends: 233 [2025-03-08 17:05:46,372 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 17:05:46,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:46,373 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 121 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:46,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 308 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:05:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 17:05:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2025-03-08 17:05:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 17:05:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-03-08 17:05:46,389 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 145 [2025-03-08 17:05:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:46,390 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-03-08 17:05:46,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:05:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-03-08 17:05:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:46,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:46,393 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:46,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:05:46,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash -446025639, now seen corresponding path program 1 times [2025-03-08 17:05:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480363103] [2025-03-08 17:05:46,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:46,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:46,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:46,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:46,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480363103] [2025-03-08 17:05:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480363103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:05:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864056622] [2025-03-08 17:05:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:48,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:05:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:48,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:05:48,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:05:48,617 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:49,460 INFO L93 Difference]: Finished difference Result 279 states and 394 transitions. [2025-03-08 17:05:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:05:49,460 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-03-08 17:05:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:49,461 INFO L225 Difference]: With dead ends: 279 [2025-03-08 17:05:49,461 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 17:05:49,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:05:49,462 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 276 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:49,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 688 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:05:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 17:05:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 128. [2025-03-08 17:05:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 17:05:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2025-03-08 17:05:49,483 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 146 [2025-03-08 17:05:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:49,483 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2025-03-08 17:05:49,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2025-03-08 17:05:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:49,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:49,484 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:05:49,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:49,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 948754960, now seen corresponding path program 1 times [2025-03-08 17:05:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677915081] [2025-03-08 17:05:49,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:49,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:49,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:49,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:51,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677915081] [2025-03-08 17:05:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677915081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:05:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078047973] [2025-03-08 17:05:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:51,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:05:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:51,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:05:51,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:05:51,088 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:51,974 INFO L93 Difference]: Finished difference Result 335 states and 474 transitions. [2025-03-08 17:05:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:05:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-03-08 17:05:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:51,977 INFO L225 Difference]: With dead ends: 335 [2025-03-08 17:05:51,977 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 17:05:51,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 17:05:51,978 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 564 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:51,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 480 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:05:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 17:05:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2025-03-08 17:05:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 157 states have internal predecessors, (206), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 17:05:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2025-03-08 17:05:52,000 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 146 [2025-03-08 17:05:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:52,000 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2025-03-08 17:05:52,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2025-03-08 17:05:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:52,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:52,002 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:52,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:05:52,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:52,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1255867333, now seen corresponding path program 1 times [2025-03-08 17:05:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:52,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477592346] [2025-03-08 17:05:52,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:52,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:52,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477592346] [2025-03-08 17:05:53,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477592346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:53,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:53,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:05:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260454727] [2025-03-08 17:05:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:53,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:05:53,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:53,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:05:53,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:05:53,345 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:53,881 INFO L93 Difference]: Finished difference Result 456 states and 639 transitions. [2025-03-08 17:05:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:53,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-03-08 17:05:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:53,885 INFO L225 Difference]: With dead ends: 456 [2025-03-08 17:05:53,887 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 17:05:53,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:05:53,888 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 298 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:53,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 416 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:05:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 17:05:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 204. [2025-03-08 17:05:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 173 states have internal predecessors, (228), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 17:05:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 286 transitions. [2025-03-08 17:05:53,910 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 286 transitions. Word has length 146 [2025-03-08 17:05:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 286 transitions. [2025-03-08 17:05:53,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 286 transitions. [2025-03-08 17:05:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:05:53,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:53,911 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:05:53,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash -156882007, now seen corresponding path program 1 times [2025-03-08 17:05:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470453517] [2025-03-08 17:05:53,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:53,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:05:54,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:05:54,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:55,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470453517] [2025-03-08 17:05:55,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470453517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:55,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:55,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:05:55,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410884010] [2025-03-08 17:05:55,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:55,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:05:55,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:55,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:05:55,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:05:55,771 INFO L87 Difference]: Start difference. First operand 204 states and 286 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:56,586 INFO L93 Difference]: Finished difference Result 451 states and 631 transitions. [2025-03-08 17:05:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:05:56,586 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-03-08 17:05:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:56,588 INFO L225 Difference]: With dead ends: 451 [2025-03-08 17:05:56,588 INFO L226 Difference]: Without dead ends: 250 [2025-03-08 17:05:56,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:05:56,590 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 336 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:56,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 661 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:05:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-08 17:05:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 206. [2025-03-08 17:05:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 174 states have (on average 1.3275862068965518) internal successors, (231), 175 states have internal predecessors, (231), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 17:05:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 289 transitions. [2025-03-08 17:05:56,612 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 289 transitions. Word has length 147 [2025-03-08 17:05:56,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:56,613 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 289 transitions. [2025-03-08 17:05:56,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 289 transitions. [2025-03-08 17:05:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:05:56,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:56,614 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:56,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:05:56,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:56,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash 681936079, now seen corresponding path program 1 times [2025-03-08 17:05:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:56,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589361414] [2025-03-08 17:05:56,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:56,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:05:56,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:05:56,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:56,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589361414] [2025-03-08 17:05:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589361414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:58,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 17:05:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107219097] [2025-03-08 17:05:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:58,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:05:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:58,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:05:58,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:05:58,119 INFO L87 Difference]: Start difference. First operand 206 states and 289 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:59,102 INFO L93 Difference]: Finished difference Result 464 states and 647 transitions. [2025-03-08 17:05:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:05:59,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-03-08 17:05:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:59,105 INFO L225 Difference]: With dead ends: 464 [2025-03-08 17:05:59,105 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 17:05:59,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:05:59,107 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 391 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:59,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 527 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:05:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 17:05:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2025-03-08 17:05:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 216 states have (on average 1.3101851851851851) internal successors, (283), 218 states have internal predecessors, (283), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 17:05:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 357 transitions. [2025-03-08 17:05:59,131 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 357 transitions. Word has length 147 [2025-03-08 17:05:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:59,132 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 357 transitions. [2025-03-08 17:05:59,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:05:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 357 transitions. [2025-03-08 17:05:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:05:59,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:59,133 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:05:59,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:05:59,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:59,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash 438755975, now seen corresponding path program 1 times [2025-03-08 17:05:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:59,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571499154] [2025-03-08 17:05:59,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:59,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:05:59,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:05:59,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:59,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:05:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:59,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571499154] [2025-03-08 17:05:59,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571499154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:59,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:05:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135311595] [2025-03-08 17:05:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:59,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:05:59,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:59,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:05:59,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:05:59,720 INFO L87 Difference]: Start difference. First operand 257 states and 357 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:06:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:00,017 INFO L93 Difference]: Finished difference Result 582 states and 806 transitions. [2025-03-08 17:06:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:06:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-08 17:06:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:00,019 INFO L225 Difference]: With dead ends: 582 [2025-03-08 17:06:00,019 INFO L226 Difference]: Without dead ends: 328 [2025-03-08 17:06:00,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:06:00,020 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 251 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:00,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 360 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:06:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-08 17:06:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 257. [2025-03-08 17:06:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 216 states have (on average 1.3055555555555556) internal successors, (282), 218 states have internal predecessors, (282), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 17:06:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 356 transitions. [2025-03-08 17:06:00,049 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 356 transitions. Word has length 147 [2025-03-08 17:06:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:00,049 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 356 transitions. [2025-03-08 17:06:00,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:06:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 356 transitions. [2025-03-08 17:06:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:06:00,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:00,051 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:06:00,051 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1544609233, now seen corresponding path program 1 times [2025-03-08 17:06:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239033702] [2025-03-08 17:06:00,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:00,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:06:00,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:06:00,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:00,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:01,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:01,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239033702] [2025-03-08 17:06:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239033702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:01,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:01,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:06:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142363619] [2025-03-08 17:06:01,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:06:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:01,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:06:01,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:06:01,236 INFO L87 Difference]: Start difference. First operand 257 states and 356 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:01,799 INFO L93 Difference]: Finished difference Result 601 states and 828 transitions. [2025-03-08 17:06:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:06:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-03-08 17:06:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:01,802 INFO L225 Difference]: With dead ends: 601 [2025-03-08 17:06:01,802 INFO L226 Difference]: Without dead ends: 347 [2025-03-08 17:06:01,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:06:01,804 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 442 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:01,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 573 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:06:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-08 17:06:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 287. [2025-03-08 17:06:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 246 states have (on average 1.3089430894308942) internal successors, (322), 248 states have internal predecessors, (322), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 17:06:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 396 transitions. [2025-03-08 17:06:01,843 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 396 transitions. Word has length 147 [2025-03-08 17:06:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:01,843 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 396 transitions. [2025-03-08 17:06:01,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 396 transitions. [2025-03-08 17:06:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:06:01,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:01,844 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:01,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:06:01,845 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:01,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -37057424, now seen corresponding path program 1 times [2025-03-08 17:06:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944756400] [2025-03-08 17:06:01,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:06:01,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:06:01,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:01,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944756400] [2025-03-08 17:06:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944756400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:04,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 17:06:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075326811] [2025-03-08 17:06:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:04,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 17:06:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:04,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 17:06:04,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:06:04,901 INFO L87 Difference]: Start difference. First operand 287 states and 396 transitions. Second operand has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-08 17:06:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:06,159 INFO L93 Difference]: Finished difference Result 642 states and 877 transitions. [2025-03-08 17:06:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:06:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 147 [2025-03-08 17:06:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:06,162 INFO L225 Difference]: With dead ends: 642 [2025-03-08 17:06:06,162 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 17:06:06,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:06:06,163 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 310 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:06,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 623 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:06:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 17:06:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 351. [2025-03-08 17:06:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 304 states have (on average 1.2960526315789473) internal successors, (394), 308 states have internal predecessors, (394), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:06:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 476 transitions. [2025-03-08 17:06:06,201 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 476 transitions. Word has length 147 [2025-03-08 17:06:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:06,202 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 476 transitions. [2025-03-08 17:06:06,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-08 17:06:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2025-03-08 17:06:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:06:06,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:06,203 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:06:06,203 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:06,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 673148720, now seen corresponding path program 1 times [2025-03-08 17:06:06,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788000570] [2025-03-08 17:06:06,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:06,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:06:06,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:06:06,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:06,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788000570] [2025-03-08 17:06:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788000570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:06:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473015417] [2025-03-08 17:06:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:09,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:06:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:09,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:06:09,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:06:09,006 INFO L87 Difference]: Start difference. First operand 351 states and 476 transitions. Second operand has 14 states, 12 states have (on average 4.583333333333333) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:10,601 INFO L93 Difference]: Finished difference Result 810 states and 1092 transitions. [2025-03-08 17:06:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:06:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.583333333333333) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-03-08 17:06:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:10,603 INFO L225 Difference]: With dead ends: 810 [2025-03-08 17:06:10,603 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 17:06:10,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-03-08 17:06:10,604 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 392 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:10,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 511 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 17:06:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 17:06:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 363. [2025-03-08 17:06:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 316 states have (on average 1.2943037974683544) internal successors, (409), 320 states have internal predecessors, (409), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:06:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 491 transitions. [2025-03-08 17:06:10,648 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 491 transitions. Word has length 147 [2025-03-08 17:06:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:10,649 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 491 transitions. [2025-03-08 17:06:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.583333333333333) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 491 transitions. [2025-03-08 17:06:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:06:10,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:10,649 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:10,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:06:10,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:10,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2114266767, now seen corresponding path program 1 times [2025-03-08 17:06:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058928694] [2025-03-08 17:06:10,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:10,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:06:10,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:06:10,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:10,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058928694] [2025-03-08 17:06:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058928694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:11,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:06:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700412258] [2025-03-08 17:06:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:11,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:06:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:06:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:06:11,100 INFO L87 Difference]: Start difference. First operand 363 states and 491 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 17:06:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:11,497 INFO L93 Difference]: Finished difference Result 767 states and 1035 transitions. [2025-03-08 17:06:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:06:11,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2025-03-08 17:06:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:11,499 INFO L225 Difference]: With dead ends: 767 [2025-03-08 17:06:11,499 INFO L226 Difference]: Without dead ends: 407 [2025-03-08 17:06:11,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:06:11,500 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 181 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:11,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 643 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:06:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-08 17:06:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 376. [2025-03-08 17:06:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 333 states have internal predecessors, (424), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:06:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 506 transitions. [2025-03-08 17:06:11,537 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 506 transitions. Word has length 147 [2025-03-08 17:06:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:11,538 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 506 transitions. [2025-03-08 17:06:11,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 17:06:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 506 transitions. [2025-03-08 17:06:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:06:11,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:11,539 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:11,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:06:11,539 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:11,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash 461797807, now seen corresponding path program 1 times [2025-03-08 17:06:11,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:11,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101076020] [2025-03-08 17:06:11,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:11,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:06:11,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:06:11,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:11,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101076020] [2025-03-08 17:06:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101076020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 17:06:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147380645] [2025-03-08 17:06:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:14,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:06:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:14,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:06:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:06:14,883 INFO L87 Difference]: Start difference. First operand 376 states and 506 transitions. Second operand has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 17:06:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:16,326 INFO L93 Difference]: Finished difference Result 788 states and 1054 transitions. [2025-03-08 17:06:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:06:16,327 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 147 [2025-03-08 17:06:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:16,328 INFO L225 Difference]: With dead ends: 788 [2025-03-08 17:06:16,328 INFO L226 Difference]: Without dead ends: 415 [2025-03-08 17:06:16,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-03-08 17:06:16,329 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 272 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:16,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 692 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 17:06:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-08 17:06:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 324. [2025-03-08 17:06:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 279 states have (on average 1.2903225806451613) internal successors, (360), 282 states have internal predecessors, (360), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 17:06:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 438 transitions. [2025-03-08 17:06:16,381 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 438 transitions. Word has length 147 [2025-03-08 17:06:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:16,382 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 438 transitions. [2025-03-08 17:06:16,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 15 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 17:06:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 438 transitions. [2025-03-08 17:06:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:16,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:16,384 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:16,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:06:16,384 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1460447311, now seen corresponding path program 1 times [2025-03-08 17:06:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:16,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093827571] [2025-03-08 17:06:16,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:16,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:16,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:16,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:16,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093827571] [2025-03-08 17:06:18,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093827571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:18,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:18,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:06:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978112606] [2025-03-08 17:06:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:18,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:06:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:18,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:06:18,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:18,144 INFO L87 Difference]: Start difference. First operand 324 states and 438 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:19,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:19,012 INFO L93 Difference]: Finished difference Result 771 states and 1041 transitions. [2025-03-08 17:06:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:06:19,013 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-03-08 17:06:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:19,015 INFO L225 Difference]: With dead ends: 771 [2025-03-08 17:06:19,015 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 17:06:19,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:06:19,017 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 404 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:19,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 433 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:06:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 17:06:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 404. [2025-03-08 17:06:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 356 states have (on average 1.3117977528089888) internal successors, (467), 360 states have internal predecessors, (467), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:06:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 549 transitions. [2025-03-08 17:06:19,073 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 549 transitions. Word has length 148 [2025-03-08 17:06:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:19,073 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 549 transitions. [2025-03-08 17:06:19,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 549 transitions. [2025-03-08 17:06:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:19,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:19,074 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:19,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:06:19,074 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:19,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 949913134, now seen corresponding path program 1 times [2025-03-08 17:06:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594848469] [2025-03-08 17:06:19,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:19,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:19,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:19,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:19,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594848469] [2025-03-08 17:06:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594848469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:20,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 17:06:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401440682] [2025-03-08 17:06:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:20,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 17:06:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:20,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 17:06:20,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:06:20,239 INFO L87 Difference]: Start difference. First operand 404 states and 549 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:21,246 INFO L93 Difference]: Finished difference Result 1014 states and 1383 transitions. [2025-03-08 17:06:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:06:21,247 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-03-08 17:06:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:21,249 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 17:06:21,249 INFO L226 Difference]: Without dead ends: 613 [2025-03-08 17:06:21,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-08 17:06:21,250 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 428 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:21,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 632 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:06:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-08 17:06:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 458. [2025-03-08 17:06:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 410 states have (on average 1.329268292682927) internal successors, (545), 414 states have internal predecessors, (545), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:06:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 627 transitions. [2025-03-08 17:06:21,297 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 627 transitions. Word has length 148 [2025-03-08 17:06:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:21,297 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 627 transitions. [2025-03-08 17:06:21,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 627 transitions. [2025-03-08 17:06:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:21,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:21,300 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 17:06:21,300 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:21,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1457907827, now seen corresponding path program 1 times [2025-03-08 17:06:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027034202] [2025-03-08 17:06:21,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:21,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:21,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:21,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027034202] [2025-03-08 17:06:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027034202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:21,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:06:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090934492] [2025-03-08 17:06:21,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:21,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:06:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:21,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:06:21,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:06:21,436 INFO L87 Difference]: Start difference. First operand 458 states and 627 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:06:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:21,581 INFO L93 Difference]: Finished difference Result 975 states and 1330 transitions. [2025-03-08 17:06:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:06:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-08 17:06:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:21,584 INFO L225 Difference]: With dead ends: 975 [2025-03-08 17:06:21,584 INFO L226 Difference]: Without dead ends: 520 [2025-03-08 17:06:21,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:06:21,585 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 64 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:21,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 379 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:06:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-08 17:06:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 468. [2025-03-08 17:06:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 420 states have (on average 1.3261904761904761) internal successors, (557), 424 states have internal predecessors, (557), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:06:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 639 transitions. [2025-03-08 17:06:21,632 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 639 transitions. Word has length 148 [2025-03-08 17:06:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:21,632 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 639 transitions. [2025-03-08 17:06:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 17:06:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 639 transitions. [2025-03-08 17:06:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:21,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:21,633 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:21,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 17:06:21,634 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:21,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1459616842, now seen corresponding path program 1 times [2025-03-08 17:06:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392001481] [2025-03-08 17:06:21,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:21,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:21,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:21,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:21,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:21,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:22,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392001481] [2025-03-08 17:06:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392001481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:22,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:22,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:06:22,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505265287] [2025-03-08 17:06:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:22,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:06:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:22,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:06:22,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:06:22,331 INFO L87 Difference]: Start difference. First operand 468 states and 639 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:06:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:22,870 INFO L93 Difference]: Finished difference Result 1018 states and 1384 transitions. [2025-03-08 17:06:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:06:22,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2025-03-08 17:06:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:22,873 INFO L225 Difference]: With dead ends: 1018 [2025-03-08 17:06:22,873 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 17:06:22,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:22,874 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 392 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:22,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 348 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:06:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 17:06:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 494. [2025-03-08 17:06:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 436 states have (on average 1.311926605504587) internal successors, (572), 441 states have internal predecessors, (572), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 17:06:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 670 transitions. [2025-03-08 17:06:22,948 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 670 transitions. Word has length 148 [2025-03-08 17:06:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:22,949 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 670 transitions. [2025-03-08 17:06:22,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:06:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 670 transitions. [2025-03-08 17:06:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:22,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:22,950 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:22,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:06:22,950 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:22,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash -106307145, now seen corresponding path program 1 times [2025-03-08 17:06:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:22,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478427343] [2025-03-08 17:06:22,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:22,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:22,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:22,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:22,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478427343] [2025-03-08 17:06:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478427343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:23,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:06:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830312365] [2025-03-08 17:06:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:23,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:06:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:23,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:06:23,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:06:23,642 INFO L87 Difference]: Start difference. First operand 494 states and 670 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:06:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:24,121 INFO L93 Difference]: Finished difference Result 1006 states and 1365 transitions. [2025-03-08 17:06:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:06:24,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2025-03-08 17:06:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:24,124 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 17:06:24,124 INFO L226 Difference]: Without dead ends: 540 [2025-03-08 17:06:24,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:24,125 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 207 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:24,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 431 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:06:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-08 17:06:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 537. [2025-03-08 17:06:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 470 states have (on average 1.3021276595744682) internal successors, (612), 476 states have internal predecessors, (612), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 17:06:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 726 transitions. [2025-03-08 17:06:24,193 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 726 transitions. Word has length 148 [2025-03-08 17:06:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:24,194 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 726 transitions. [2025-03-08 17:06:24,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:06:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 726 transitions. [2025-03-08 17:06:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:24,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:24,195 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:24,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:06:24,195 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash 450192883, now seen corresponding path program 1 times [2025-03-08 17:06:24,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854615740] [2025-03-08 17:06:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:24,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:24,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:24,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:24,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:25,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:25,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854615740] [2025-03-08 17:06:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854615740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 17:06:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419405921] [2025-03-08 17:06:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:25,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:06:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:25,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:06:25,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:06:25,825 INFO L87 Difference]: Start difference. First operand 537 states and 726 transitions. Second operand has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:26,739 INFO L93 Difference]: Finished difference Result 1105 states and 1494 transitions. [2025-03-08 17:06:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:06:26,742 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-03-08 17:06:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:26,744 INFO L225 Difference]: With dead ends: 1105 [2025-03-08 17:06:26,744 INFO L226 Difference]: Without dead ends: 596 [2025-03-08 17:06:26,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-08 17:06:26,746 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 527 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:26,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 523 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:06:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-08 17:06:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 588. [2025-03-08 17:06:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 512 states have (on average 1.296875) internal successors, (664), 519 states have internal predecessors, (664), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 17:06:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 794 transitions. [2025-03-08 17:06:26,822 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 794 transitions. Word has length 148 [2025-03-08 17:06:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:26,823 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 794 transitions. [2025-03-08 17:06:26,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 794 transitions. [2025-03-08 17:06:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:26,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:26,824 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:26,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 17:06:26,824 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:26,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:26,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1105257555, now seen corresponding path program 1 times [2025-03-08 17:06:26,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:26,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828454351] [2025-03-08 17:06:26,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:26,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:26,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:26,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:26,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828454351] [2025-03-08 17:06:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828454351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:28,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:28,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 17:06:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073758277] [2025-03-08 17:06:28,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:28,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:06:28,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:28,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:06:28,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:06:28,670 INFO L87 Difference]: Start difference. First operand 588 states and 794 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:06:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:29,512 INFO L93 Difference]: Finished difference Result 1284 states and 1728 transitions. [2025-03-08 17:06:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:06:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2025-03-08 17:06:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:29,515 INFO L225 Difference]: With dead ends: 1284 [2025-03-08 17:06:29,515 INFO L226 Difference]: Without dead ends: 724 [2025-03-08 17:06:29,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-08 17:06:29,517 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 250 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:29,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 567 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:06:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-08 17:06:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 604. [2025-03-08 17:06:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 528 states have (on average 1.293560606060606) internal successors, (683), 535 states have internal predecessors, (683), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 17:06:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 813 transitions. [2025-03-08 17:06:29,607 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 813 transitions. Word has length 148 [2025-03-08 17:06:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:29,608 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 813 transitions. [2025-03-08 17:06:29,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:06:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 813 transitions. [2025-03-08 17:06:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:29,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:29,610 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:29,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 17:06:29,610 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash 402294254, now seen corresponding path program 1 times [2025-03-08 17:06:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:29,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556689750] [2025-03-08 17:06:29,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:29,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:29,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:29,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:29,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:33,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:33,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556689750] [2025-03-08 17:06:33,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556689750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:33,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:33,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:06:33,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029467259] [2025-03-08 17:06:33,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:33,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:06:33,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:33,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:06:33,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:06:33,361 INFO L87 Difference]: Start difference. First operand 604 states and 813 transitions. Second operand has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 17:06:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:34,610 INFO L93 Difference]: Finished difference Result 1323 states and 1770 transitions. [2025-03-08 17:06:34,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:06:34,611 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 148 [2025-03-08 17:06:34,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:34,614 INFO L225 Difference]: With dead ends: 1323 [2025-03-08 17:06:34,614 INFO L226 Difference]: Without dead ends: 747 [2025-03-08 17:06:34,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:06:34,616 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 248 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:34,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 563 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:06:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-08 17:06:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 629. [2025-03-08 17:06:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 550 states have (on average 1.290909090909091) internal successors, (710), 558 states have internal predecessors, (710), 67 states have call successors, (67), 11 states have call predecessors, (67), 11 states have return successors, (67), 59 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 17:06:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 844 transitions. [2025-03-08 17:06:34,702 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 844 transitions. Word has length 148 [2025-03-08 17:06:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:34,702 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 844 transitions. [2025-03-08 17:06:34,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 17:06:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 844 transitions. [2025-03-08 17:06:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:34,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:34,703 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:34,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 17:06:34,704 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:34,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1074237748, now seen corresponding path program 1 times [2025-03-08 17:06:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354355540] [2025-03-08 17:06:34,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:34,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:34,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:34,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:34,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:40,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354355540] [2025-03-08 17:06:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354355540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:40,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 17:06:40,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739117919] [2025-03-08 17:06:40,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:40,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 17:06:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:40,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 17:06:40,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:06:40,723 INFO L87 Difference]: Start difference. First operand 629 states and 844 transitions. Second operand has 18 states, 14 states have (on average 4.0) internal successors, (56), 18 states have internal predecessors, (56), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-08 17:06:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:44,342 INFO L93 Difference]: Finished difference Result 1482 states and 1968 transitions. [2025-03-08 17:06:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:06:44,343 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 4.0) internal successors, (56), 18 states have internal predecessors, (56), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 7 states have call successors, (19) Word has length 148 [2025-03-08 17:06:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:44,346 INFO L225 Difference]: With dead ends: 1482 [2025-03-08 17:06:44,346 INFO L226 Difference]: Without dead ends: 881 [2025-03-08 17:06:44,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-03-08 17:06:44,347 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 509 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:44,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 762 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 17:06:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-08 17:06:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 647. [2025-03-08 17:06:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 568 states have (on average 1.2922535211267605) internal successors, (734), 576 states have internal predecessors, (734), 67 states have call successors, (67), 11 states have call predecessors, (67), 11 states have return successors, (67), 59 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 17:06:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 868 transitions. [2025-03-08 17:06:44,448 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 868 transitions. Word has length 148 [2025-03-08 17:06:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:44,448 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 868 transitions. [2025-03-08 17:06:44,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 4.0) internal successors, (56), 18 states have internal predecessors, (56), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-08 17:06:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 868 transitions. [2025-03-08 17:06:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:44,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:44,449 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 17:06:44,449 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:44,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 433314061, now seen corresponding path program 1 times [2025-03-08 17:06:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299306281] [2025-03-08 17:06:44,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:44,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:44,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:44,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:44,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:44,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299306281] [2025-03-08 17:06:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299306281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:06:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546299719] [2025-03-08 17:06:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:06:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:44,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:06:44,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:44,959 INFO L87 Difference]: Start difference. First operand 647 states and 868 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 17:06:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:45,396 INFO L93 Difference]: Finished difference Result 1395 states and 1868 transitions. [2025-03-08 17:06:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:06:45,396 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-03-08 17:06:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:45,399 INFO L225 Difference]: With dead ends: 1395 [2025-03-08 17:06:45,399 INFO L226 Difference]: Without dead ends: 776 [2025-03-08 17:06:45,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:06:45,400 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 334 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:45,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 599 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:06:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-08 17:06:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 647. [2025-03-08 17:06:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 568 states have (on average 1.2922535211267605) internal successors, (734), 576 states have internal predecessors, (734), 67 states have call successors, (67), 11 states have call predecessors, (67), 11 states have return successors, (67), 59 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 17:06:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 868 transitions. [2025-03-08 17:06:45,499 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 868 transitions. Word has length 148 [2025-03-08 17:06:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:45,499 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 868 transitions. [2025-03-08 17:06:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 17:06:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 868 transitions. [2025-03-08 17:06:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:06:45,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:45,500 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:45,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 17:06:45,502 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:45,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash 963818541, now seen corresponding path program 1 times [2025-03-08 17:06:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703874084] [2025-03-08 17:06:45,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:45,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:06:45,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:06:45,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:45,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703874084] [2025-03-08 17:06:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703874084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 17:06:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007921457] [2025-03-08 17:06:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:06:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:06:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:06:49,494 INFO L87 Difference]: Start difference. First operand 647 states and 868 transitions. Second operand has 17 states, 14 states have (on average 4.0) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-08 17:06:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:51,128 INFO L93 Difference]: Finished difference Result 1413 states and 1882 transitions. [2025-03-08 17:06:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:06:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.0) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 148 [2025-03-08 17:06:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:51,132 INFO L225 Difference]: With dead ends: 1413 [2025-03-08 17:06:51,132 INFO L226 Difference]: Without dead ends: 794 [2025-03-08 17:06:51,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-03-08 17:06:51,133 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 313 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:51,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 731 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 17:06:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-08 17:06:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 533. [2025-03-08 17:06:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 466 states have (on average 1.3047210300429184) internal successors, (608), 472 states have internal predecessors, (608), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 17:06:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 722 transitions. [2025-03-08 17:06:51,219 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 722 transitions. Word has length 148 [2025-03-08 17:06:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:51,219 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 722 transitions. [2025-03-08 17:06:51,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.0) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-08 17:06:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 722 transitions. [2025-03-08 17:06:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 17:06:51,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:51,221 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:51,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 17:06:51,221 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1566019195, now seen corresponding path program 1 times [2025-03-08 17:06:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:51,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162122462] [2025-03-08 17:06:51,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 17:06:51,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 17:06:51,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:51,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162122462] [2025-03-08 17:06:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162122462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:52,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:52,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:06:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943947218] [2025-03-08 17:06:52,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:52,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:06:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:52,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:06:52,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:06:52,258 INFO L87 Difference]: Start difference. First operand 533 states and 722 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:52,871 INFO L93 Difference]: Finished difference Result 1037 states and 1404 transitions. [2025-03-08 17:06:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:06:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-08 17:06:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:52,874 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 17:06:52,874 INFO L226 Difference]: Without dead ends: 532 [2025-03-08 17:06:52,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:06:52,875 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 288 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:52,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 370 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:06:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-08 17:06:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 503. [2025-03-08 17:06:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 436 states have (on average 1.2798165137614679) internal successors, (558), 442 states have internal predecessors, (558), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 17:06:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 672 transitions. [2025-03-08 17:06:52,958 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 672 transitions. Word has length 149 [2025-03-08 17:06:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:52,958 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 672 transitions. [2025-03-08 17:06:52,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 17:06:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 672 transitions. [2025-03-08 17:06:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 17:06:52,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:52,960 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:52,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 17:06:52,960 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:52,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1809199299, now seen corresponding path program 1 times [2025-03-08 17:06:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368659411] [2025-03-08 17:06:52,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:52,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 17:06:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 17:06:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368659411] [2025-03-08 17:06:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368659411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 17:06:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981669741] [2025-03-08 17:06:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:06:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:55,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:06:55,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:06:55,868 INFO L87 Difference]: Start difference. First operand 503 states and 672 transitions. Second operand has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 17:06:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:56,920 INFO L93 Difference]: Finished difference Result 1104 states and 1472 transitions. [2025-03-08 17:06:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:06:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 149 [2025-03-08 17:06:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:56,923 INFO L225 Difference]: With dead ends: 1104 [2025-03-08 17:06:56,924 INFO L226 Difference]: Without dead ends: 629 [2025-03-08 17:06:56,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:06:56,925 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 235 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:56,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 485 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 17:06:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-08 17:06:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2025-03-08 17:06:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 446 states have (on average 1.2780269058295963) internal successors, (570), 452 states have internal predecessors, (570), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 17:06:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 684 transitions. [2025-03-08 17:06:57,011 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 684 transitions. Word has length 149 [2025-03-08 17:06:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:57,012 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 684 transitions. [2025-03-08 17:06:57,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 17:06:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 684 transitions. [2025-03-08 17:06:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 17:06:57,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:57,013 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:06:57,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 17:06:57,013 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1975233820, now seen corresponding path program 1 times [2025-03-08 17:06:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954768215] [2025-03-08 17:06:57,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:57,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 17:06:57,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 17:06:57,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:57,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 17:06:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954768215] [2025-03-08 17:06:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954768215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:58,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 17:06:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504683617] [2025-03-08 17:06:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:58,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 17:06:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:58,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 17:06:58,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-08 17:06:58,759 INFO L87 Difference]: Start difference. First operand 513 states and 684 transitions. Second operand has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:07:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:00,054 INFO L93 Difference]: Finished difference Result 1082 states and 1443 transitions. [2025-03-08 17:07:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 17:07:00,055 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-03-08 17:07:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:00,057 INFO L225 Difference]: With dead ends: 1082 [2025-03-08 17:07:00,057 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 17:07:00,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2025-03-08 17:07:00,059 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 236 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:00,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 783 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:07:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 17:07:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 519. [2025-03-08 17:07:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 458 states have internal predecessors, (578), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 17:07:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 692 transitions. [2025-03-08 17:07:00,143 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 692 transitions. Word has length 149 [2025-03-08 17:07:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:00,144 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 692 transitions. [2025-03-08 17:07:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 17:07:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 692 transitions. [2025-03-08 17:07:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 17:07:00,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:00,145 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:07:00,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 17:07:00,145 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1554462754, now seen corresponding path program 1 times [2025-03-08 17:07:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211369847] [2025-03-08 17:07:00,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:00,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 17:07:00,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 17:07:00,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:00,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat