./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.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-ap_file-66.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 d1d83a7aa7482f86e6852a22c01d45006c9d5171e3bfe65b1880a039304a6026 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:31:13,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:31:13,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:31:13,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:31:13,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:31:13,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:31:13,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:31:13,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:31:13,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:31:13,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:31:13,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:31:13,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:31:13,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:31:13,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:31:13,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:31:13,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:31:13,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:31:13,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:31:13,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:31:13,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:31:13,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:31:13,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:31:13,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:31:13,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:31:13,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:31:13,940 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 -> d1d83a7aa7482f86e6852a22c01d45006c9d5171e3bfe65b1880a039304a6026 [2025-03-08 16:31:14,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:31:14,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:31:14,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:31:14,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:31:14,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:31:14,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i [2025-03-08 16:31:15,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f65f6df5/f0f5255c3a1f49e198174fbb50ce1452/FLAG2c0691846 [2025-03-08 16:31:15,525 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:31:15,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i [2025-03-08 16:31:15,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f65f6df5/f0f5255c3a1f49e198174fbb50ce1452/FLAG2c0691846 [2025-03-08 16:31:15,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f65f6df5/f0f5255c3a1f49e198174fbb50ce1452 [2025-03-08 16:31:15,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:31:15,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:31:15,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:31:15,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:31:15,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:31:15,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:31:15" (1/1) ... [2025-03-08 16:31:15,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:15, skipping insertion in model container [2025-03-08 16:31:15,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:31:15" (1/1) ... [2025-03-08 16:31:15,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:31:15,945 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-ap_file-66.i[917,930] [2025-03-08 16:31:15,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:31:15,990 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:31:16,000 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-ap_file-66.i[917,930] [2025-03-08 16:31:16,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:31:16,056 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:31:16,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16 WrapperNode [2025-03-08 16:31:16,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:31:16,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:31:16,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:31:16,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:31:16,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,099 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2025-03-08 16:31:16,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:31:16,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:31:16,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:31:16,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:31:16,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,123 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2025-03-08 16:31:16,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:31:16,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:31:16,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:31:16,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:31:16,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (1/1) ... [2025-03-08 16:31:16,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:31:16,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:31:16,174 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 16:31:16,176 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 16:31:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:31:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:31:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:31:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:31:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:31:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:31:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:31:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:31:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:31:16,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:31:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:31:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:31:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:31:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:31:16,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:31:16,299 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:31:16,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:31:16,640 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem75#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite100#1;havoc property_#t~mem80#1;havoc property_#t~ite99#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem98#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-08 16:31:16,678 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-08 16:31:16,679 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:31:16,685 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:31:16,686 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:31:16,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:31:16 BoogieIcfgContainer [2025-03-08 16:31:16,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:31:16,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:31:16,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:31:16,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:31:16,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:31:15" (1/3) ... [2025-03-08 16:31:16,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d83362d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:31:16, skipping insertion in model container [2025-03-08 16:31:16,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:31:16" (2/3) ... [2025-03-08 16:31:16,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d83362d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:31:16, skipping insertion in model container [2025-03-08 16:31:16,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:31:16" (3/3) ... [2025-03-08 16:31:16,693 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-66.i [2025-03-08 16:31:16,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:31:16,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-66.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:31:16,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:31:16,758 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;@3896b6b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:31:16,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:31:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:31:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:31:16,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:16,771 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:16,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:16,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1469854672, now seen corresponding path program 1 times [2025-03-08 16:31:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945448958] [2025-03-08 16:31:16,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:16,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:31:16,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:31:16,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:16,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:31:17,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:17,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945448958] [2025-03-08 16:31:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945448958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:31:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551094889] [2025-03-08 16:31:17,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:17,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:31:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:31:17,009 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 16:31:17,011 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 16:31:17,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:31:17,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:31:17,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:17,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:17,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:31:17,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:31:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:31:17,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:31:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551094889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:17,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:31:17,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:31:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120942576] [2025-03-08 16:31:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:17,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:31:17,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:17,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:31:17,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:31:17,245 INFO L87 Difference]: Start difference. First operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:31:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:17,261 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-03-08 16:31:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:31:17,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-08 16:31:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:17,266 INFO L225 Difference]: With dead ends: 164 [2025-03-08 16:31:17,266 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 16:31:17,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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 16:31:17,270 INFO L435 NwaCegarLoop]: 118 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, 118 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 16:31:17,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:31:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 16:31:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 16:31:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:31:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-08 16:31:17,299 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2025-03-08 16:31:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:17,299 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-08 16:31:17,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:31:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-08 16:31:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:31:17,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:17,301 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:17,308 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 16:31:17,503 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 16:31:17,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:17,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1478786114, now seen corresponding path program 1 times [2025-03-08 16:31:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68840863] [2025-03-08 16:31:17,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:17,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:31:17,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:31:17,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:17,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68840863] [2025-03-08 16:31:17,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68840863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:17,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:17,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:31:17,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520539177] [2025-03-08 16:31:17,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:17,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:31:17,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:17,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:31:17,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:31:17,779 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:17,822 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2025-03-08 16:31:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:31:17,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-08 16:31:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:17,825 INFO L225 Difference]: With dead ends: 164 [2025-03-08 16:31:17,825 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 16:31:17,825 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 16:31:17,826 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 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 16:31:17,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:31:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 16:31:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-08 16:31:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:31:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-08 16:31:17,840 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2025-03-08 16:31:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:17,842 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-08 16:31:17,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-08 16:31:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:31:17,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:17,844 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:17,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:31:17,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1928677501, now seen corresponding path program 1 times [2025-03-08 16:31:17,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:17,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101805830] [2025-03-08 16:31:17,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:17,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:31:17,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:31:17,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:17,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:18,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:18,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101805830] [2025-03-08 16:31:18,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101805830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:18,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:18,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:31:18,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9021838] [2025-03-08 16:31:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:18,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:31:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:18,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:31:18,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:31:18,014 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:18,038 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2025-03-08 16:31:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:31:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-08 16:31:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:18,039 INFO L225 Difference]: With dead ends: 168 [2025-03-08 16:31:18,039 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 16:31:18,040 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 16:31:18,040 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 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 16:31:18,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:31:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 16:31:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-08 16:31:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:31:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-03-08 16:31:18,047 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2025-03-08 16:31:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:18,047 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-03-08 16:31:18,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-03-08 16:31:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:31:18,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:18,049 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:18,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:31:18,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:18,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1927753980, now seen corresponding path program 1 times [2025-03-08 16:31:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:18,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489306147] [2025-03-08 16:31:18,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:18,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:31:18,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:31:18,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:18,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489306147] [2025-03-08 16:31:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489306147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:31:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603640377] [2025-03-08 16:31:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:18,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:31:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:18,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:31:18,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:31:18,919 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:19,236 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-03-08 16:31:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:31:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 109 [2025-03-08 16:31:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:19,239 INFO L225 Difference]: With dead ends: 252 [2025-03-08 16:31:19,239 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 16:31:19,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:31:19,240 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 92 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:19,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 519 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:31:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 16:31:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-03-08 16:31:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.323076923076923) internal successors, (172), 130 states have internal predecessors, (172), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:31:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 228 transitions. [2025-03-08 16:31:19,253 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 228 transitions. Word has length 109 [2025-03-08 16:31:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:19,253 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 228 transitions. [2025-03-08 16:31:19,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2025-03-08 16:31:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:31:19,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:19,255 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:19,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:31:19,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:19,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash -911179747, now seen corresponding path program 1 times [2025-03-08 16:31:19,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:19,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221942697] [2025-03-08 16:31:19,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:19,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:31:19,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:31:19,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:19,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221942697] [2025-03-08 16:31:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221942697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:31:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6075174] [2025-03-08 16:31:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:31:19,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:19,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:31:19,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:31:19,613 INFO L87 Difference]: Start difference. First operand 161 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:19,860 INFO L93 Difference]: Finished difference Result 356 states and 498 transitions. [2025-03-08 16:31:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:31:19,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-08 16:31:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:19,863 INFO L225 Difference]: With dead ends: 356 [2025-03-08 16:31:19,863 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 16:31:19,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:31:19,864 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 186 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:19,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 353 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 16:31:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 220. [2025-03-08 16:31:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 183 states have (on average 1.3333333333333333) internal successors, (244), 185 states have internal predecessors, (244), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:31:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 308 transitions. [2025-03-08 16:31:19,890 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 308 transitions. Word has length 110 [2025-03-08 16:31:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:19,890 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 308 transitions. [2025-03-08 16:31:19,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 308 transitions. [2025-03-08 16:31:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:31:19,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:19,891 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:19,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:31:19,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:19,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2030477852, now seen corresponding path program 1 times [2025-03-08 16:31:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:19,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068242270] [2025-03-08 16:31:19,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:19,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:19,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:31:20,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:31:20,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:20,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:22,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:22,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068242270] [2025-03-08 16:31:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068242270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:31:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500391989] [2025-03-08 16:31:22,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:31:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:22,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:31:22,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:31:22,043 INFO L87 Difference]: Start difference. First operand 220 states and 308 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:31:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:22,992 INFO L93 Difference]: Finished difference Result 738 states and 1041 transitions. [2025-03-08 16:31:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:31:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2025-03-08 16:31:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:22,997 INFO L225 Difference]: With dead ends: 738 [2025-03-08 16:31:22,997 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 16:31:22,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:31:22,998 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 560 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:22,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 480 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:31:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 16:31:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 258. [2025-03-08 16:31:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 208 states have (on average 1.3125) internal successors, (273), 210 states have internal predecessors, (273), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:31:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 361 transitions. [2025-03-08 16:31:23,034 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 361 transitions. Word has length 110 [2025-03-08 16:31:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:23,034 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 361 transitions. [2025-03-08 16:31:23,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:31:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 361 transitions. [2025-03-08 16:31:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:31:23,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:23,035 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:23,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:31:23,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:23,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1737074845, now seen corresponding path program 1 times [2025-03-08 16:31:23,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:23,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562525838] [2025-03-08 16:31:23,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:23,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:31:23,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:31:23,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:23,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562525838] [2025-03-08 16:31:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562525838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:31:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17311968] [2025-03-08 16:31:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:23,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:31:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:31:23,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:31:23,619 INFO L87 Difference]: Start difference. First operand 258 states and 361 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:23,875 INFO L93 Difference]: Finished difference Result 523 states and 727 transitions. [2025-03-08 16:31:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:31:23,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2025-03-08 16:31:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:23,877 INFO L225 Difference]: With dead ends: 523 [2025-03-08 16:31:23,877 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 16:31:23,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:31:23,878 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 336 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:23,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 343 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 16:31:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 223. [2025-03-08 16:31:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 188 states have (on average 1.3297872340425532) internal successors, (250), 189 states have internal predecessors, (250), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:31:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 310 transitions. [2025-03-08 16:31:23,897 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 310 transitions. Word has length 110 [2025-03-08 16:31:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 310 transitions. [2025-03-08 16:31:23,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 310 transitions. [2025-03-08 16:31:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 16:31:23,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:23,899 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:23,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:31:23,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:23,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 510456538, now seen corresponding path program 1 times [2025-03-08 16:31:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227335667] [2025-03-08 16:31:23,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:23,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:31:23,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:31:23,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:23,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:31:24,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227335667] [2025-03-08 16:31:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227335667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:31:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791006119] [2025-03-08 16:31:24,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:24,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:31:24,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:31:24,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:31:24,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:31:24,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:31:24,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:31:24,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:24,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:24,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:31:24,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:31:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:24,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:31:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791006119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:31:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:31:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38844655] [2025-03-08 16:31:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:24,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:31:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:24,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:31:24,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:31:24,173 INFO L87 Difference]: Start difference. First operand 223 states and 310 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:24,208 INFO L93 Difference]: Finished difference Result 452 states and 629 transitions. [2025-03-08 16:31:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:31:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-08 16:31:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:24,210 INFO L225 Difference]: With dead ends: 452 [2025-03-08 16:31:24,210 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 16:31:24,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:31:24,210 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:24,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:31:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 16:31:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-08 16:31:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 198 states have internal predecessors, (259), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:31:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 319 transitions. [2025-03-08 16:31:24,236 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 319 transitions. Word has length 113 [2025-03-08 16:31:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:24,237 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 319 transitions. [2025-03-08 16:31:24,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 319 transitions. [2025-03-08 16:31:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 16:31:24,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:24,238 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:24,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:31:24,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 16:31:24,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -124147616, now seen corresponding path program 1 times [2025-03-08 16:31:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236381950] [2025-03-08 16:31:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:24,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:31:24,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:31:24,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:24,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236381950] [2025-03-08 16:31:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236381950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:25,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:25,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:31:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551818210] [2025-03-08 16:31:25,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:25,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:31:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:25,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:31:25,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:31:25,209 INFO L87 Difference]: Start difference. First operand 232 states and 319 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:26,023 INFO L93 Difference]: Finished difference Result 609 states and 831 transitions. [2025-03-08 16:31:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:31:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 113 [2025-03-08 16:31:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:26,025 INFO L225 Difference]: With dead ends: 609 [2025-03-08 16:31:26,025 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 16:31:26,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:31:26,027 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 719 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:26,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 655 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:31:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 16:31:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 323. [2025-03-08 16:31:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 272 states have (on average 1.3125) internal successors, (357), 274 states have internal predecessors, (357), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:31:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 445 transitions. [2025-03-08 16:31:26,076 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 445 transitions. Word has length 113 [2025-03-08 16:31:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:26,076 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 445 transitions. [2025-03-08 16:31:26,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 445 transitions. [2025-03-08 16:31:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 16:31:26,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:26,077 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:26,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:31:26,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:26,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -417550623, now seen corresponding path program 1 times [2025-03-08 16:31:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:26,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500298992] [2025-03-08 16:31:26,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:26,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:31:26,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:31:26,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:26,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500298992] [2025-03-08 16:31:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500298992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:26,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:26,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:31:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312453789] [2025-03-08 16:31:26,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:26,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:31:26,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:26,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:31:26,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:31:26,678 INFO L87 Difference]: Start difference. First operand 323 states and 445 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:27,022 INFO L93 Difference]: Finished difference Result 691 states and 950 transitions. [2025-03-08 16:31:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:31:27,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-03-08 16:31:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:27,024 INFO L225 Difference]: With dead ends: 691 [2025-03-08 16:31:27,024 INFO L226 Difference]: Without dead ends: 453 [2025-03-08 16:31:27,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:31:27,026 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 240 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:27,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 725 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-08 16:31:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 372. [2025-03-08 16:31:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 316 states have internal predecessors, (407), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:31:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 507 transitions. [2025-03-08 16:31:27,065 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 507 transitions. Word has length 113 [2025-03-08 16:31:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:27,065 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 507 transitions. [2025-03-08 16:31:27,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 507 transitions. [2025-03-08 16:31:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 16:31:27,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:27,066 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:31:27,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:27,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash 87203297, now seen corresponding path program 1 times [2025-03-08 16:31:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121120006] [2025-03-08 16:31:27,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:27,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:31:27,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:31:27,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:27,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121120006] [2025-03-08 16:31:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121120006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:31:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425739065] [2025-03-08 16:31:27,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:27,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:31:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:27,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:31:27,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:31:27,681 INFO L87 Difference]: Start difference. First operand 372 states and 507 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:28,152 INFO L93 Difference]: Finished difference Result 661 states and 899 transitions. [2025-03-08 16:31:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:31:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 113 [2025-03-08 16:31:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:28,156 INFO L225 Difference]: With dead ends: 661 [2025-03-08 16:31:28,157 INFO L226 Difference]: Without dead ends: 374 [2025-03-08 16:31:28,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:31:28,159 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 358 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:28,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 445 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:31:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-08 16:31:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 246. [2025-03-08 16:31:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 201 states have (on average 1.2686567164179106) internal successors, (255), 202 states have internal predecessors, (255), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:31:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 331 transitions. [2025-03-08 16:31:28,196 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 331 transitions. Word has length 113 [2025-03-08 16:31:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:28,196 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 331 transitions. [2025-03-08 16:31:28,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 331 transitions. [2025-03-08 16:31:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:31:28,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:28,198 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:28,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:31:28,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:28,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash 623297436, now seen corresponding path program 1 times [2025-03-08 16:31:28,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:28,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294490233] [2025-03-08 16:31:28,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:28,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:31:28,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:31:28,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:28,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294490233] [2025-03-08 16:31:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294490233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:31:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071372072] [2025-03-08 16:31:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:28,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:31:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:28,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:31:28,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:31:28,396 INFO L87 Difference]: Start difference. First operand 246 states and 331 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:28,643 INFO L93 Difference]: Finished difference Result 755 states and 1024 transitions. [2025-03-08 16:31:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:31:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-08 16:31:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:28,646 INFO L225 Difference]: With dead ends: 755 [2025-03-08 16:31:28,646 INFO L226 Difference]: Without dead ends: 512 [2025-03-08 16:31:28,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:31:28,647 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 146 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:28,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 367 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-08 16:31:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 331. [2025-03-08 16:31:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 270 states have (on average 1.2740740740740741) internal successors, (344), 271 states have internal predecessors, (344), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2025-03-08 16:31:28,697 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 115 [2025-03-08 16:31:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:28,697 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2025-03-08 16:31:28,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2025-03-08 16:31:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:31:28,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:28,700 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:28,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:31:28,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:28,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1509681494, now seen corresponding path program 1 times [2025-03-08 16:31:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:28,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095314080] [2025-03-08 16:31:28,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:28,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:31:28,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:31:28,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:28,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095314080] [2025-03-08 16:31:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095314080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:31:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962228970] [2025-03-08 16:31:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:31:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:29,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:31:29,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:31:29,553 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:31:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:30,320 INFO L93 Difference]: Finished difference Result 665 states and 903 transitions. [2025-03-08 16:31:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:31:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 115 [2025-03-08 16:31:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:30,323 INFO L225 Difference]: With dead ends: 665 [2025-03-08 16:31:30,323 INFO L226 Difference]: Without dead ends: 422 [2025-03-08 16:31:30,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:31:30,324 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 336 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:30,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 638 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:31:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-08 16:31:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 362. [2025-03-08 16:31:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 301 states have (on average 1.282392026578073) internal successors, (386), 302 states have internal predecessors, (386), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 490 transitions. [2025-03-08 16:31:30,364 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 490 transitions. Word has length 115 [2025-03-08 16:31:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:30,364 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 490 transitions. [2025-03-08 16:31:30,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:31:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 490 transitions. [2025-03-08 16:31:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:31:30,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:30,366 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:31:30,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:30,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2130849245, now seen corresponding path program 1 times [2025-03-08 16:31:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:30,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20265725] [2025-03-08 16:31:30,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:30,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:31:30,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:31:30,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:30,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20265725] [2025-03-08 16:31:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20265725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:30,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:30,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:31:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275939184] [2025-03-08 16:31:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:30,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:31:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:30,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:31:30,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:31:30,601 INFO L87 Difference]: Start difference. First operand 362 states and 490 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:30,865 INFO L93 Difference]: Finished difference Result 600 states and 810 transitions. [2025-03-08 16:31:30,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:31:30,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-08 16:31:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:30,869 INFO L225 Difference]: With dead ends: 600 [2025-03-08 16:31:30,869 INFO L226 Difference]: Without dead ends: 439 [2025-03-08 16:31:30,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:31:30,871 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 161 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:30,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 564 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-08 16:31:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 393. [2025-03-08 16:31:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 332 states have (on average 1.2981927710843373) internal successors, (431), 333 states have internal predecessors, (431), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 535 transitions. [2025-03-08 16:31:30,909 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 535 transitions. Word has length 115 [2025-03-08 16:31:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:30,910 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 535 transitions. [2025-03-08 16:31:30,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 535 transitions. [2025-03-08 16:31:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:31:30,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:30,911 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:30,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:31:30,911 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:30,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -959316212, now seen corresponding path program 1 times [2025-03-08 16:31:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135415427] [2025-03-08 16:31:30,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:30,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:31:30,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:31:30,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:30,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135415427] [2025-03-08 16:31:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135415427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:31,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:31,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:31:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797641367] [2025-03-08 16:31:31,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:31,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:31:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:31,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:31:31,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:31:31,220 INFO L87 Difference]: Start difference. First operand 393 states and 535 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:31,401 INFO L93 Difference]: Finished difference Result 691 states and 940 transitions. [2025-03-08 16:31:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:31:31,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-08 16:31:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:31,403 INFO L225 Difference]: With dead ends: 691 [2025-03-08 16:31:31,403 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 16:31:31,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:31:31,405 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 152 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:31,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 342 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:31:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 16:31:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2025-03-08 16:31:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 332 states have (on average 1.2951807228915662) internal successors, (430), 333 states have internal predecessors, (430), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 534 transitions. [2025-03-08 16:31:31,447 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 534 transitions. Word has length 116 [2025-03-08 16:31:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:31,447 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 534 transitions. [2025-03-08 16:31:31,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 534 transitions. [2025-03-08 16:31:31,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:31:31,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:31,448 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:31:31,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -338148461, now seen corresponding path program 1 times [2025-03-08 16:31:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851723474] [2025-03-08 16:31:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:31:31,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:31:31,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:31,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:31,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851723474] [2025-03-08 16:31:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851723474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:31,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:31,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:31:31,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250073976] [2025-03-08 16:31:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:31,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:31:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:31,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:31:31,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:31:31,746 INFO L87 Difference]: Start difference. First operand 393 states and 534 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:32,109 INFO L93 Difference]: Finished difference Result 787 states and 1065 transitions. [2025-03-08 16:31:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:31:32,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2025-03-08 16:31:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:32,113 INFO L225 Difference]: With dead ends: 787 [2025-03-08 16:31:32,113 INFO L226 Difference]: Without dead ends: 491 [2025-03-08 16:31:32,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:31:32,114 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 231 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:32,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 532 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:31:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-08 16:31:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 393. [2025-03-08 16:31:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 332 states have (on average 1.2921686746987953) internal successors, (429), 333 states have internal predecessors, (429), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 533 transitions. [2025-03-08 16:31:32,153 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 533 transitions. Word has length 116 [2025-03-08 16:31:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:32,154 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 533 transitions. [2025-03-08 16:31:32,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 533 transitions. [2025-03-08 16:31:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:31:32,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:32,155 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:31:32,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:32,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:32,155 INFO L85 PathProgramCache]: Analyzing trace with hash -366055527, now seen corresponding path program 1 times [2025-03-08 16:31:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788840163] [2025-03-08 16:31:32,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:32,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:31:32,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:31:32,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:32,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788840163] [2025-03-08 16:31:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788840163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 16:31:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373767295] [2025-03-08 16:31:33,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:33,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 16:31:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:33,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 16:31:33,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:31:33,548 INFO L87 Difference]: Start difference. First operand 393 states and 533 transitions. Second operand has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-08 16:31:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:34,891 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2025-03-08 16:31:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:31:34,892 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 117 [2025-03-08 16:31:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:34,894 INFO L225 Difference]: With dead ends: 503 [2025-03-08 16:31:34,894 INFO L226 Difference]: Without dead ends: 501 [2025-03-08 16:31:34,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:31:34,895 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 670 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:34,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 654 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:31:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-08 16:31:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 438. [2025-03-08 16:31:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 377 states have (on average 1.2944297082228118) internal successors, (488), 378 states have internal predecessors, (488), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 592 transitions. [2025-03-08 16:31:34,933 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 592 transitions. Word has length 117 [2025-03-08 16:31:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:34,933 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 592 transitions. [2025-03-08 16:31:34,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-08 16:31:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 592 transitions. [2025-03-08 16:31:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:31:34,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:34,934 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:34,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:31:34,935 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:34,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash -365132006, now seen corresponding path program 1 times [2025-03-08 16:31:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973879420] [2025-03-08 16:31:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:34,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:31:34,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:31:34,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:34,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973879420] [2025-03-08 16:31:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973879420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:35,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:35,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:31:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404534006] [2025-03-08 16:31:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:35,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:31:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:35,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:31:35,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:31:35,879 INFO L87 Difference]: Start difference. First operand 438 states and 592 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:37,203 INFO L93 Difference]: Finished difference Result 1013 states and 1362 transitions. [2025-03-08 16:31:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:31:37,203 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 117 [2025-03-08 16:31:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:37,206 INFO L225 Difference]: With dead ends: 1013 [2025-03-08 16:31:37,206 INFO L226 Difference]: Without dead ends: 679 [2025-03-08 16:31:37,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2025-03-08 16:31:37,207 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 486 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:37,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1114 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:31:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-08 16:31:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 504. [2025-03-08 16:31:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 443 states have (on average 1.3115124153498872) internal successors, (581), 444 states have internal predecessors, (581), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 685 transitions. [2025-03-08 16:31:37,252 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 685 transitions. Word has length 117 [2025-03-08 16:31:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:37,252 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 685 transitions. [2025-03-08 16:31:37,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 685 transitions. [2025-03-08 16:31:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:31:37,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:37,254 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:37,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:31:37,254 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:37,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 522371675, now seen corresponding path program 1 times [2025-03-08 16:31:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:37,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528398180] [2025-03-08 16:31:37,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:37,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:31:37,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:31:37,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:37,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:31:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:37,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528398180] [2025-03-08 16:31:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528398180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:31:37,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551319057] [2025-03-08 16:31:37,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:37,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:31:37,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:31:37,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:31:37,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:31:37,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:31:37,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:31:37,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:37,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:37,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 16:31:37,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:31:38,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:31:38,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:31:38,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:31:38,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:31:38,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:31:38,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:31:39,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:31:39,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:31:39,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:31:39,593 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 16:31:39,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-03-08 16:31:39,663 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 16:31:39,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-03-08 16:31:39,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:31:39,771 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2025-03-08 16:31:39,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 [2025-03-08 16:31:39,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:31:39,894 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-08 16:31:39,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 51 [2025-03-08 16:31:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 76 proven. 239 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 16:31:39,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:31:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551319057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:31:44,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:31:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2025-03-08 16:31:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148886546] [2025-03-08 16:31:44,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:31:44,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 16:31:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:44,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 16:31:44,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=791, Unknown=1, NotChecked=0, Total=930 [2025-03-08 16:31:44,316 INFO L87 Difference]: Start difference. First operand 504 states and 685 transitions. Second operand has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2025-03-08 16:31:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:47,891 INFO L93 Difference]: Finished difference Result 964 states and 1275 transitions. [2025-03-08 16:31:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 16:31:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) Word has length 117 [2025-03-08 16:31:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:47,895 INFO L225 Difference]: With dead ends: 964 [2025-03-08 16:31:47,895 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 16:31:47,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=686, Invalid=2393, Unknown=1, NotChecked=0, Total=3080 [2025-03-08 16:31:47,896 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 756 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 184 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:47,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 620 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1127 Invalid, 2 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 16:31:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 16:31:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 464. [2025-03-08 16:31:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 396 states have (on average 1.2676767676767677) internal successors, (502), 397 states have internal predecessors, (502), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 606 transitions. [2025-03-08 16:31:47,955 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 606 transitions. Word has length 117 [2025-03-08 16:31:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:47,955 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 606 transitions. [2025-03-08 16:31:47,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2025-03-08 16:31:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 606 transitions. [2025-03-08 16:31:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:31:47,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:47,956 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:47,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:31:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:31:48,157 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 427911894, now seen corresponding path program 1 times [2025-03-08 16:31:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425275352] [2025-03-08 16:31:48,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:48,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:31:48,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:31:48,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:48,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425275352] [2025-03-08 16:31:48,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425275352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:48,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:48,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:31:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626546107] [2025-03-08 16:31:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:48,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:31:48,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:48,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:31:48,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:31:48,608 INFO L87 Difference]: Start difference. First operand 464 states and 606 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:49,143 INFO L93 Difference]: Finished difference Result 659 states and 860 transitions. [2025-03-08 16:31:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:31:49,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-03-08 16:31:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:49,145 INFO L225 Difference]: With dead ends: 659 [2025-03-08 16:31:49,145 INFO L226 Difference]: Without dead ends: 464 [2025-03-08 16:31:49,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:31:49,146 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 197 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:49,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 261 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:31:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-08 16:31:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-08 16:31:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 396 states have (on average 1.2575757575757576) internal successors, (498), 397 states have internal predecessors, (498), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 602 transitions. [2025-03-08 16:31:49,201 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 602 transitions. Word has length 119 [2025-03-08 16:31:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:49,201 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 602 transitions. [2025-03-08 16:31:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 602 transitions. [2025-03-08 16:31:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:31:49,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:49,202 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:49,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:31:49,202 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:49,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2100031199, now seen corresponding path program 1 times [2025-03-08 16:31:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:49,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396413145] [2025-03-08 16:31:49,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:49,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:31:49,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:31:49,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:49,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:49,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396413145] [2025-03-08 16:31:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396413145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:49,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:31:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644582473] [2025-03-08 16:31:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:49,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:31:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:49,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:31:49,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:31:49,463 INFO L87 Difference]: Start difference. First operand 464 states and 602 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:49,770 INFO L93 Difference]: Finished difference Result 913 states and 1191 transitions. [2025-03-08 16:31:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:31:49,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-08 16:31:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:49,773 INFO L225 Difference]: With dead ends: 913 [2025-03-08 16:31:49,773 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 16:31:49,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:31:49,774 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 194 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:49,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 477 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 16:31:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 484. [2025-03-08 16:31:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 416 states have (on average 1.2572115384615385) internal successors, (523), 417 states have internal predecessors, (523), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 627 transitions. [2025-03-08 16:31:49,885 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 627 transitions. Word has length 119 [2025-03-08 16:31:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:49,885 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 627 transitions. [2025-03-08 16:31:49,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 627 transitions. [2025-03-08 16:31:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:31:49,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:49,887 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:49,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:31:49,887 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:49,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:49,888 INFO L85 PathProgramCache]: Analyzing trace with hash -55538051, now seen corresponding path program 1 times [2025-03-08 16:31:49,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:49,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067085624] [2025-03-08 16:31:49,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:49,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:31:49,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:31:49,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:49,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:50,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067085624] [2025-03-08 16:31:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067085624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:50,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:50,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:31:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570482620] [2025-03-08 16:31:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:50,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:31:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:50,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:31:50,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:31:50,298 INFO L87 Difference]: Start difference. First operand 484 states and 627 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:50,654 INFO L93 Difference]: Finished difference Result 599 states and 774 transitions. [2025-03-08 16:31:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:31:50,654 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-08 16:31:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:50,657 INFO L225 Difference]: With dead ends: 599 [2025-03-08 16:31:50,657 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 16:31:50,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:31:50,659 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:50,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 505 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 16:31:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 559. [2025-03-08 16:31:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 491 states have (on average 1.2729124236252545) internal successors, (625), 492 states have internal predecessors, (625), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2025-03-08 16:31:50,745 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 119 [2025-03-08 16:31:50,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:50,746 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2025-03-08 16:31:50,746 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2025-03-08 16:31:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:31:50,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:50,747 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:50,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:31:50,748 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:50,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash 832889151, now seen corresponding path program 1 times [2025-03-08 16:31:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:50,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181378490] [2025-03-08 16:31:50,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:50,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:31:50,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:31:50,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:50,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:51,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181378490] [2025-03-08 16:31:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181378490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:31:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61706180] [2025-03-08 16:31:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:31:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:51,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:31:51,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:31:51,395 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:52,191 INFO L93 Difference]: Finished difference Result 1126 states and 1465 transitions. [2025-03-08 16:31:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:31:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-08 16:31:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:52,194 INFO L225 Difference]: With dead ends: 1126 [2025-03-08 16:31:52,194 INFO L226 Difference]: Without dead ends: 672 [2025-03-08 16:31:52,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:31:52,196 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 372 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:52,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 833 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:31:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-08 16:31:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 591. [2025-03-08 16:31:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 523 states have (on average 1.27151051625239) internal successors, (665), 524 states have internal predecessors, (665), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 769 transitions. [2025-03-08 16:31:52,307 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 769 transitions. Word has length 119 [2025-03-08 16:31:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:52,308 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 769 transitions. [2025-03-08 16:31:52,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 769 transitions. [2025-03-08 16:31:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:31:52,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:52,308 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:52,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:31:52,309 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:52,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash -964062208, now seen corresponding path program 1 times [2025-03-08 16:31:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:52,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135301722] [2025-03-08 16:31:52,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:52,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:31:52,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:31:52,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:52,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:52,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135301722] [2025-03-08 16:31:52,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135301722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:52,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:52,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:31:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053746452] [2025-03-08 16:31:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:52,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:31:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:52,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:31:52,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:31:52,651 INFO L87 Difference]: Start difference. First operand 591 states and 769 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:53,002 INFO L93 Difference]: Finished difference Result 1202 states and 1571 transitions. [2025-03-08 16:31:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:31:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-08 16:31:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:53,005 INFO L225 Difference]: With dead ends: 1202 [2025-03-08 16:31:53,005 INFO L226 Difference]: Without dead ends: 721 [2025-03-08 16:31:53,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:31:53,006 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 328 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:53,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 694 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-08 16:31:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 655. [2025-03-08 16:31:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 587 states have (on average 1.2759795570698467) internal successors, (749), 588 states have internal predecessors, (749), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 853 transitions. [2025-03-08 16:31:53,064 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 853 transitions. Word has length 119 [2025-03-08 16:31:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:53,064 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 853 transitions. [2025-03-08 16:31:53,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 853 transitions. [2025-03-08 16:31:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:31:53,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:53,065 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:53,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:31:53,065 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:53,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653632, now seen corresponding path program 1 times [2025-03-08 16:31:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656388399] [2025-03-08 16:31:53,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:53,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:31:53,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:31:53,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:53,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656388399] [2025-03-08 16:31:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656388399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:31:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217157769] [2025-03-08 16:31:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:31:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:31:53,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:31:53,321 INFO L87 Difference]: Start difference. First operand 655 states and 853 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:53,602 INFO L93 Difference]: Finished difference Result 1274 states and 1657 transitions. [2025-03-08 16:31:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:31:53,603 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-08 16:31:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:53,605 INFO L225 Difference]: With dead ends: 1274 [2025-03-08 16:31:53,605 INFO L226 Difference]: Without dead ends: 709 [2025-03-08 16:31:53,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:31:53,606 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 166 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:53,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 574 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:31:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-08 16:31:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 653. [2025-03-08 16:31:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 585 states have (on average 1.2683760683760683) internal successors, (742), 586 states have internal predecessors, (742), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 846 transitions. [2025-03-08 16:31:53,666 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 846 transitions. Word has length 119 [2025-03-08 16:31:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:53,667 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 846 transitions. [2025-03-08 16:31:53,667 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 846 transitions. [2025-03-08 16:31:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:31:53,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:53,668 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:53,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:31:53,668 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:53,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -756034376, now seen corresponding path program 1 times [2025-03-08 16:31:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:53,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270205126] [2025-03-08 16:31:53,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:53,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:31:53,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:31:53,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:53,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:53,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270205126] [2025-03-08 16:31:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270205126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:31:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255005276] [2025-03-08 16:31:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:53,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:31:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:53,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:31:53,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:31:53,991 INFO L87 Difference]: Start difference. First operand 653 states and 846 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:54,361 INFO L93 Difference]: Finished difference Result 1286 states and 1685 transitions. [2025-03-08 16:31:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:31:54,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-08 16:31:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:54,365 INFO L225 Difference]: With dead ends: 1286 [2025-03-08 16:31:54,365 INFO L226 Difference]: Without dead ends: 912 [2025-03-08 16:31:54,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:31:54,366 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 346 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:54,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 503 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-08 16:31:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 703. [2025-03-08 16:31:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 635 states have (on average 1.2519685039370079) internal successors, (795), 636 states have internal predecessors, (795), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 899 transitions. [2025-03-08 16:31:54,475 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 899 transitions. Word has length 120 [2025-03-08 16:31:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:54,476 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 899 transitions. [2025-03-08 16:31:54,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:31:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 899 transitions. [2025-03-08 16:31:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:31:54,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:54,477 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:54,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:31:54,477 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1753106729, now seen corresponding path program 1 times [2025-03-08 16:31:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034919929] [2025-03-08 16:31:54,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:54,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:31:54,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:31:54,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:54,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:54,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034919929] [2025-03-08 16:31:54,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034919929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:54,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:31:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263963729] [2025-03-08 16:31:54,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:54,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:31:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:54,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:31:54,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:31:54,629 INFO L87 Difference]: Start difference. First operand 703 states and 899 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:54,857 INFO L93 Difference]: Finished difference Result 1439 states and 1846 transitions. [2025-03-08 16:31:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:31:54,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-03-08 16:31:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:54,860 INFO L225 Difference]: With dead ends: 1439 [2025-03-08 16:31:54,860 INFO L226 Difference]: Without dead ends: 875 [2025-03-08 16:31:54,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 16:31:54,861 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 29 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:54,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 383 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:31:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-08 16:31:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 700. [2025-03-08 16:31:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 632 states have (on average 1.2325949367088607) internal successors, (779), 633 states have internal predecessors, (779), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 883 transitions. [2025-03-08 16:31:54,921 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 883 transitions. Word has length 120 [2025-03-08 16:31:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:54,921 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 883 transitions. [2025-03-08 16:31:54,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 883 transitions. [2025-03-08 16:31:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:31:54,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:54,922 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:54,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:31:54,922 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:54,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash -823041129, now seen corresponding path program 1 times [2025-03-08 16:31:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:54,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736015353] [2025-03-08 16:31:54,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:54,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:31:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:31:54,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:54,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736015353] [2025-03-08 16:31:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736015353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:31:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780719669] [2025-03-08 16:31:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:55,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:31:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:55,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:31:55,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:31:55,554 INFO L87 Difference]: Start difference. First operand 700 states and 883 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:56,325 INFO L93 Difference]: Finished difference Result 1036 states and 1306 transitions. [2025-03-08 16:31:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:31:56,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120 [2025-03-08 16:31:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:56,329 INFO L225 Difference]: With dead ends: 1036 [2025-03-08 16:31:56,329 INFO L226 Difference]: Without dead ends: 712 [2025-03-08 16:31:56,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:31:56,330 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 391 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:56,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 557 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:31:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-08 16:31:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 667. [2025-03-08 16:31:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 599 states have (on average 1.2270450751252087) internal successors, (735), 600 states have internal predecessors, (735), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 839 transitions. [2025-03-08 16:31:56,420 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 839 transitions. Word has length 120 [2025-03-08 16:31:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:56,420 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 839 transitions. [2025-03-08 16:31:56,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 839 transitions. [2025-03-08 16:31:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:31:56,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:56,421 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:31:56,421 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:56,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2065638475, now seen corresponding path program 1 times [2025-03-08 16:31:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348596353] [2025-03-08 16:31:56,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:56,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:31:56,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:31:56,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:56,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:56,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:56,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348596353] [2025-03-08 16:31:56,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348596353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:56,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:56,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:31:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43268246] [2025-03-08 16:31:56,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:56,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:31:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:56,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:31:56,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:31:56,671 INFO L87 Difference]: Start difference. First operand 667 states and 839 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:57,295 INFO L93 Difference]: Finished difference Result 1052 states and 1317 transitions. [2025-03-08 16:31:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:31:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-03-08 16:31:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:57,297 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 16:31:57,297 INFO L226 Difference]: Without dead ends: 724 [2025-03-08 16:31:57,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:31:57,304 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:57,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 673 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:31:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-08 16:31:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 655. [2025-03-08 16:31:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 587 states have (on average 1.2282793867120954) internal successors, (721), 588 states have internal predecessors, (721), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 825 transitions. [2025-03-08 16:31:57,367 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 825 transitions. Word has length 120 [2025-03-08 16:31:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:57,367 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 825 transitions. [2025-03-08 16:31:57,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:31:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 825 transitions. [2025-03-08 16:31:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:31:57,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:57,368 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:57,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:31:57,368 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:57,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1854287562, now seen corresponding path program 1 times [2025-03-08 16:31:57,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:57,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383869933] [2025-03-08 16:31:57,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:57,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:57,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:31:57,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:31:57,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:57,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:31:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:31:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:31:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383869933] [2025-03-08 16:31:58,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383869933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:31:58,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:31:58,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:31:58,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791291094] [2025-03-08 16:31:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:31:58,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:31:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:31:58,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:31:58,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:31:58,378 INFO L87 Difference]: Start difference. First operand 655 states and 825 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:31:59,679 INFO L93 Difference]: Finished difference Result 1111 states and 1392 transitions. [2025-03-08 16:31:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:31:59,679 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120 [2025-03-08 16:31:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:31:59,682 INFO L225 Difference]: With dead ends: 1111 [2025-03-08 16:31:59,682 INFO L226 Difference]: Without dead ends: 795 [2025-03-08 16:31:59,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:31:59,683 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 223 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:31:59,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 742 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:31:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-08 16:31:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 679. [2025-03-08 16:31:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 611 states have (on average 1.2242225859247136) internal successors, (748), 612 states have internal predecessors, (748), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:31:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 852 transitions. [2025-03-08 16:31:59,749 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 852 transitions. Word has length 120 [2025-03-08 16:31:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:31:59,749 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 852 transitions. [2025-03-08 16:31:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:31:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 852 transitions. [2025-03-08 16:31:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:31:59,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:31:59,750 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:59,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:31:59,750 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:31:59,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:31:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2109024107, now seen corresponding path program 1 times [2025-03-08 16:31:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:31:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116701114] [2025-03-08 16:31:59,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:31:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:31:59,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:31:59,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:31:59,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:31:59,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:00,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116701114] [2025-03-08 16:32:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116701114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:00,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:32:00,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77394643] [2025-03-08 16:32:00,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:00,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:32:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:00,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:32:00,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:32:00,196 INFO L87 Difference]: Start difference. First operand 679 states and 852 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:00,836 INFO L93 Difference]: Finished difference Result 1056 states and 1322 transitions. [2025-03-08 16:32:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:32:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120 [2025-03-08 16:32:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:00,839 INFO L225 Difference]: With dead ends: 1056 [2025-03-08 16:32:00,839 INFO L226 Difference]: Without dead ends: 740 [2025-03-08 16:32:00,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:32:00,840 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 236 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:00,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 610 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:32:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-08 16:32:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 651. [2025-03-08 16:32:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 583 states have (on average 1.2264150943396226) internal successors, (715), 584 states have internal predecessors, (715), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 819 transitions. [2025-03-08 16:32:00,902 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 819 transitions. Word has length 120 [2025-03-08 16:32:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 819 transitions. [2025-03-08 16:32:00,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 819 transitions. [2025-03-08 16:32:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:32:00,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:00,903 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 16:32:00,904 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1570072885, now seen corresponding path program 1 times [2025-03-08 16:32:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302636430] [2025-03-08 16:32:00,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:00,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:32:00,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:32:00,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:00,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302636430] [2025-03-08 16:32:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302636430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:01,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:01,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:32:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310151856] [2025-03-08 16:32:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:01,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:32:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:32:01,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:32:01,114 INFO L87 Difference]: Start difference. First operand 651 states and 819 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:32:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:01,348 INFO L93 Difference]: Finished difference Result 1207 states and 1512 transitions. [2025-03-08 16:32:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:32:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-08 16:32:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:01,351 INFO L225 Difference]: With dead ends: 1207 [2025-03-08 16:32:01,351 INFO L226 Difference]: Without dead ends: 921 [2025-03-08 16:32:01,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:32:01,352 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 44 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:01,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 579 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:32:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-08 16:32:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 808. [2025-03-08 16:32:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 740 states have (on average 1.218918918918919) internal successors, (902), 741 states have internal predecessors, (902), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1006 transitions. [2025-03-08 16:32:01,413 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1006 transitions. Word has length 122 [2025-03-08 16:32:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:01,413 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1006 transitions. [2025-03-08 16:32:01,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:32:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1006 transitions. [2025-03-08 16:32:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:32:01,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:01,414 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:01,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 16:32:01,414 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash 676158044, now seen corresponding path program 1 times [2025-03-08 16:32:01,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700517695] [2025-03-08 16:32:01,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:01,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:32:01,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:32:01,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:01,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700517695] [2025-03-08 16:32:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700517695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:02,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:32:02,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796642065] [2025-03-08 16:32:02,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:02,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:32:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:02,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:32:02,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:32:02,334 INFO L87 Difference]: Start difference. First operand 808 states and 1006 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:03,579 INFO L93 Difference]: Finished difference Result 1565 states and 1958 transitions. [2025-03-08 16:32:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:32:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-03-08 16:32:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:03,582 INFO L225 Difference]: With dead ends: 1565 [2025-03-08 16:32:03,582 INFO L226 Difference]: Without dead ends: 1179 [2025-03-08 16:32:03,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:32:03,583 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 257 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:03,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 928 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:32:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-03-08 16:32:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 919. [2025-03-08 16:32:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 851 states have (on average 1.2244418331374853) internal successors, (1042), 852 states have internal predecessors, (1042), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1146 transitions. [2025-03-08 16:32:03,649 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1146 transitions. Word has length 123 [2025-03-08 16:32:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:03,650 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1146 transitions. [2025-03-08 16:32:03,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1146 transitions. [2025-03-08 16:32:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:03,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:03,650 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:03,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 16:32:03,651 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:03,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash 607977337, now seen corresponding path program 1 times [2025-03-08 16:32:03,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:03,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342254508] [2025-03-08 16:32:03,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:03,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:03,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:03,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:03,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:05,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:05,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342254508] [2025-03-08 16:32:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342254508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:05,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:05,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:32:05,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617307679] [2025-03-08 16:32:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:05,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:32:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:05,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:32:05,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:32:05,438 INFO L87 Difference]: Start difference. First operand 919 states and 1146 transitions. Second operand has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:08,183 INFO L93 Difference]: Finished difference Result 1735 states and 2177 transitions. [2025-03-08 16:32:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:32:08,184 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:32:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:08,187 INFO L225 Difference]: With dead ends: 1735 [2025-03-08 16:32:08,187 INFO L226 Difference]: Without dead ends: 1286 [2025-03-08 16:32:08,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:32:08,188 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 602 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:08,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 803 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 16:32:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-03-08 16:32:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 970. [2025-03-08 16:32:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 902 states have (on average 1.229490022172949) internal successors, (1109), 903 states have internal predecessors, (1109), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1213 transitions. [2025-03-08 16:32:08,260 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1213 transitions. Word has length 125 [2025-03-08 16:32:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:08,260 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1213 transitions. [2025-03-08 16:32:08,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1213 transitions. [2025-03-08 16:32:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:08,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:08,261 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:08,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 16:32:08,261 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:08,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1961287034, now seen corresponding path program 1 times [2025-03-08 16:32:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:08,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530739107] [2025-03-08 16:32:08,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:08,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:08,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:08,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:08,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530739107] [2025-03-08 16:32:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530739107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:08,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:08,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:32:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261732106] [2025-03-08 16:32:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:08,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:32:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:08,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:32:08,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:32:08,422 INFO L87 Difference]: Start difference. First operand 970 states and 1213 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:32:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:08,662 INFO L93 Difference]: Finished difference Result 1669 states and 2099 transitions. [2025-03-08 16:32:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:32:08,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-08 16:32:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:08,666 INFO L225 Difference]: With dead ends: 1669 [2025-03-08 16:32:08,666 INFO L226 Difference]: Without dead ends: 1177 [2025-03-08 16:32:08,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:32:08,667 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 41 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:08,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 400 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:32:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-08 16:32:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 990. [2025-03-08 16:32:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 922 states have (on average 1.2386117136659436) internal successors, (1142), 923 states have internal predecessors, (1142), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1246 transitions. [2025-03-08 16:32:08,739 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1246 transitions. Word has length 125 [2025-03-08 16:32:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:08,739 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1246 transitions. [2025-03-08 16:32:08,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:32:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1246 transitions. [2025-03-08 16:32:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:08,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:08,740 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 16:32:08,740 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash -826128453, now seen corresponding path program 1 times [2025-03-08 16:32:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970297082] [2025-03-08 16:32:08,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:08,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:08,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:08,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:08,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:09,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970297082] [2025-03-08 16:32:09,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970297082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:09,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:09,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:32:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206522014] [2025-03-08 16:32:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:09,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:32:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:09,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:32:09,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:32:09,671 INFO L87 Difference]: Start difference. First operand 990 states and 1246 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:10,531 INFO L93 Difference]: Finished difference Result 1926 states and 2432 transitions. [2025-03-08 16:32:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:32:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:32:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:10,536 INFO L225 Difference]: With dead ends: 1926 [2025-03-08 16:32:10,536 INFO L226 Difference]: Without dead ends: 1394 [2025-03-08 16:32:10,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:32:10,537 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 259 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:10,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 491 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:32:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-08 16:32:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1113. [2025-03-08 16:32:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1045 states have (on average 1.2334928229665072) internal successors, (1289), 1046 states have internal predecessors, (1289), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1393 transitions. [2025-03-08 16:32:10,626 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1393 transitions. Word has length 125 [2025-03-08 16:32:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:10,626 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1393 transitions. [2025-03-08 16:32:10,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1393 transitions. [2025-03-08 16:32:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:10,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:10,628 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:10,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 16:32:10,628 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:10,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1329888841, now seen corresponding path program 1 times [2025-03-08 16:32:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683780522] [2025-03-08 16:32:10,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:10,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:10,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:10,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:11,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683780522] [2025-03-08 16:32:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683780522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:11,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:11,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:32:11,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506098246] [2025-03-08 16:32:11,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:32:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:11,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:32:11,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:32:11,883 INFO L87 Difference]: Start difference. First operand 1113 states and 1393 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:12,914 INFO L93 Difference]: Finished difference Result 1877 states and 2358 transitions. [2025-03-08 16:32:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:32:12,915 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:32:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:12,918 INFO L225 Difference]: With dead ends: 1877 [2025-03-08 16:32:12,918 INFO L226 Difference]: Without dead ends: 1362 [2025-03-08 16:32:12,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:32:12,919 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 356 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:12,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 662 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:32:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-03-08 16:32:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1116. [2025-03-08 16:32:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1048 states have (on average 1.2328244274809161) internal successors, (1292), 1049 states have internal predecessors, (1292), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1396 transitions. [2025-03-08 16:32:12,996 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1396 transitions. Word has length 125 [2025-03-08 16:32:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:12,996 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1396 transitions. [2025-03-08 16:32:12,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1396 transitions. [2025-03-08 16:32:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:12,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:12,997 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:12,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 16:32:12,997 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:12,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 185901561, now seen corresponding path program 1 times [2025-03-08 16:32:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350029925] [2025-03-08 16:32:12,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:13,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:13,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:13,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:13,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350029925] [2025-03-08 16:32:13,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350029925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:13,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:13,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:32:13,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423563377] [2025-03-08 16:32:13,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:13,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:32:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:13,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:32:13,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:32:13,590 INFO L87 Difference]: Start difference. First operand 1116 states and 1396 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:14,463 INFO L93 Difference]: Finished difference Result 1895 states and 2378 transitions. [2025-03-08 16:32:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:32:14,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-03-08 16:32:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:14,467 INFO L225 Difference]: With dead ends: 1895 [2025-03-08 16:32:14,467 INFO L226 Difference]: Without dead ends: 1330 [2025-03-08 16:32:14,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:32:14,468 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 524 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:14,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 554 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:32:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-08 16:32:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1128. [2025-03-08 16:32:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1060 states have (on average 1.230188679245283) internal successors, (1304), 1061 states have internal predecessors, (1304), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1408 transitions. [2025-03-08 16:32:14,545 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1408 transitions. Word has length 125 [2025-03-08 16:32:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:14,545 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1408 transitions. [2025-03-08 16:32:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1408 transitions. [2025-03-08 16:32:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:14,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:14,546 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:14,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 16:32:14,546 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:14,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:14,546 INFO L85 PathProgramCache]: Analyzing trace with hash -987063369, now seen corresponding path program 1 times [2025-03-08 16:32:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483898577] [2025-03-08 16:32:14,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:14,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:14,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:14,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:14,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:17,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483898577] [2025-03-08 16:32:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483898577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:17,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:32:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926903178] [2025-03-08 16:32:17,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:17,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:32:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:17,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:32:17,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:32:17,256 INFO L87 Difference]: Start difference. First operand 1128 states and 1408 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:19,454 INFO L93 Difference]: Finished difference Result 1924 states and 2420 transitions. [2025-03-08 16:32:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:32:19,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:32:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:19,458 INFO L225 Difference]: With dead ends: 1924 [2025-03-08 16:32:19,458 INFO L226 Difference]: Without dead ends: 1382 [2025-03-08 16:32:19,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:32:19,459 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 157 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:19,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 659 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:32:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-03-08 16:32:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1134. [2025-03-08 16:32:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1066 states have (on average 1.2288930581613509) internal successors, (1310), 1067 states have internal predecessors, (1310), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1414 transitions. [2025-03-08 16:32:19,600 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1414 transitions. Word has length 125 [2025-03-08 16:32:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1414 transitions. [2025-03-08 16:32:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1414 transitions. [2025-03-08 16:32:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:19,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:19,601 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:19,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 16:32:19,602 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1575699590, now seen corresponding path program 1 times [2025-03-08 16:32:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774014702] [2025-03-08 16:32:19,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:19,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:19,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:19,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:19,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774014702] [2025-03-08 16:32:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774014702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:21,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:32:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433494423] [2025-03-08 16:32:21,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:21,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:32:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:21,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:32:21,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:32:21,039 INFO L87 Difference]: Start difference. First operand 1134 states and 1414 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:22,502 INFO L93 Difference]: Finished difference Result 1935 states and 2415 transitions. [2025-03-08 16:32:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:32:22,502 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:32:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:22,506 INFO L225 Difference]: With dead ends: 1935 [2025-03-08 16:32:22,506 INFO L226 Difference]: Without dead ends: 1399 [2025-03-08 16:32:22,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:32:22,507 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 343 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:22,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 679 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:32:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-08 16:32:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1128. [2025-03-08 16:32:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1060 states have (on average 1.2188679245283018) internal successors, (1292), 1061 states have internal predecessors, (1292), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1396 transitions. [2025-03-08 16:32:22,590 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1396 transitions. Word has length 125 [2025-03-08 16:32:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:22,590 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1396 transitions. [2025-03-08 16:32:22,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1396 transitions. [2025-03-08 16:32:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:22,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:22,591 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 16:32:22,591 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1285161916, now seen corresponding path program 1 times [2025-03-08 16:32:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145506879] [2025-03-08 16:32:22,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:22,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:22,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:22,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:22,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:24,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:24,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145506879] [2025-03-08 16:32:24,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145506879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:24,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:24,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:32:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812156995] [2025-03-08 16:32:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:24,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:32:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:24,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:32:24,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:32:24,300 INFO L87 Difference]: Start difference. First operand 1128 states and 1396 transitions. Second operand has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:26,918 INFO L93 Difference]: Finished difference Result 1865 states and 2307 transitions. [2025-03-08 16:32:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:32:26,918 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:32:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:26,923 INFO L225 Difference]: With dead ends: 1865 [2025-03-08 16:32:26,923 INFO L226 Difference]: Without dead ends: 1343 [2025-03-08 16:32:26,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:32:26,924 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 312 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:26,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1124 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 16:32:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-03-08 16:32:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1126. [2025-03-08 16:32:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1058 states have (on average 1.2173913043478262) internal successors, (1288), 1059 states have internal predecessors, (1288), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1392 transitions. [2025-03-08 16:32:27,003 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1392 transitions. Word has length 125 [2025-03-08 16:32:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:27,003 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1392 transitions. [2025-03-08 16:32:27,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:32:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1392 transitions. [2025-03-08 16:32:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:27,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:27,004 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:27,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 16:32:27,004 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash 781401528, now seen corresponding path program 1 times [2025-03-08 16:32:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109899652] [2025-03-08 16:32:27,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:27,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109899652] [2025-03-08 16:32:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109899652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:32:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876680877] [2025-03-08 16:32:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:28,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:32:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:28,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:32:28,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:32:28,986 INFO L87 Difference]: Start difference. First operand 1126 states and 1392 transitions. Second operand has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:32:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:31,604 INFO L93 Difference]: Finished difference Result 1915 states and 2377 transitions. [2025-03-08 16:32:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:32:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 6 states have call successors, (14) Word has length 125 [2025-03-08 16:32:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:31,608 INFO L225 Difference]: With dead ends: 1915 [2025-03-08 16:32:31,609 INFO L226 Difference]: Without dead ends: 1394 [2025-03-08 16:32:31,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:32:31,610 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 474 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:31,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1566 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 16:32:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-08 16:32:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1121. [2025-03-08 16:32:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1053 states have (on average 1.2136752136752136) internal successors, (1278), 1054 states have internal predecessors, (1278), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1382 transitions. [2025-03-08 16:32:31,692 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1382 transitions. Word has length 125 [2025-03-08 16:32:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:31,693 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1382 transitions. [2025-03-08 16:32:31,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:32:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1382 transitions. [2025-03-08 16:32:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:31,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:31,693 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:31,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 16:32:31,694 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:31,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash -490223557, now seen corresponding path program 1 times [2025-03-08 16:32:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101339778] [2025-03-08 16:32:31,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:31,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:31,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:31,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:31,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:32:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:32:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:32:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101339778] [2025-03-08 16:32:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101339778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:32:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:32:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:32:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687226140] [2025-03-08 16:32:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:32:32,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:32:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:32:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:32:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:32:32,100 INFO L87 Difference]: Start difference. First operand 1121 states and 1382 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:32:32,601 INFO L93 Difference]: Finished difference Result 1779 states and 2215 transitions. [2025-03-08 16:32:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:32:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-03-08 16:32:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:32:32,604 INFO L225 Difference]: With dead ends: 1779 [2025-03-08 16:32:32,604 INFO L226 Difference]: Without dead ends: 1121 [2025-03-08 16:32:32,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:32:32,606 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 186 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:32:32,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 276 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:32:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-08 16:32:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2025-03-08 16:32:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1053 states have (on average 1.210826210826211) internal successors, (1275), 1054 states have internal predecessors, (1275), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:32:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1379 transitions. [2025-03-08 16:32:32,687 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1379 transitions. Word has length 125 [2025-03-08 16:32:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:32:32,687 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1379 transitions. [2025-03-08 16:32:32,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:32:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1379 transitions. [2025-03-08 16:32:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:32:32,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:32:32,688 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:32,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 16:32:32,688 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:32:32,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:32:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash -139423620, now seen corresponding path program 1 times [2025-03-08 16:32:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:32:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847248327] [2025-03-08 16:32:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:32:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:32:32,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:32:32,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:32:32,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:32:32,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat