./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.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 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:14:41,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:14:41,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:14:41,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:14:41,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:14:41,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:14:41,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:14:41,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:14:41,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:14:41,851 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:14:41,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:14:41,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:14:41,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:14:41,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:14:41,852 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:14:41,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:14:41,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:14:41,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:14:41,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:14:41,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:14:41,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:14:41,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:14:41,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:14:41,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:14:41,854 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 -> 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 [2025-03-17 06:14:42,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:14:42,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:14:42,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:14:42,122 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:14:42,122 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:14:42,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2025-03-17 06:14:43,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2efaec7/d62f9e5ecba74ce48ce768684372bba9/FLAGcc1ac3f4d [2025-03-17 06:14:43,565 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:14:43,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2025-03-17 06:14:43,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2efaec7/d62f9e5ecba74ce48ce768684372bba9/FLAGcc1ac3f4d [2025-03-17 06:14:43,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2efaec7/d62f9e5ecba74ce48ce768684372bba9 [2025-03-17 06:14:43,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:14:43,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:14:43,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:14:43,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:14:43,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:14:43,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:14:43" (1/1) ... [2025-03-17 06:14:43,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481070aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:43, skipping insertion in model container [2025-03-17 06:14:43,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:14:43" (1/1) ... [2025-03-17 06:14:43,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:14:43,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i[917,930] [2025-03-17 06:14:44,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:14:44,052 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:14:44,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i[917,930] [2025-03-17 06:14:44,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:14:44,121 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:14:44,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44 WrapperNode [2025-03-17 06:14:44,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:14:44,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:14:44,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:14:44,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:14:44,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,166 INFO L138 Inliner]: procedures = 27, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2025-03-17 06:14:44,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:14:44,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:14:44,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:14:44,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:14:44,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,204 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-03-17 06:14:44,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:14:44,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:14:44,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:14:44,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:14:44,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:14:44,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:44,251 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-17 06:14:44,257 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-17 06:14:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:14:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 06:14:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 06:14:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:14:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:14:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:14:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:14:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:14:44,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:14:44,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:14:44,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:14:44,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:14:44,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:14:44,367 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:14:44,368 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:14:44,703 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc property_#t~mem73#1;havoc property_#t~ite82#1;havoc property_#t~mem81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short112#1;havoc property_#t~mem118#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short128#1; [2025-03-17 06:14:44,749 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-17 06:14:44,750 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:14:44,760 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:14:44,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:14:44,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:14:44 BoogieIcfgContainer [2025-03-17 06:14:44,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:14:44,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:14:44,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:14:44,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:14:44,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:14:43" (1/3) ... [2025-03-17 06:14:44,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d4902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:14:44, skipping insertion in model container [2025-03-17 06:14:44,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (2/3) ... [2025-03-17 06:14:44,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d4902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:14:44, skipping insertion in model container [2025-03-17 06:14:44,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:14:44" (3/3) ... [2025-03-17 06:14:44,769 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-90.i [2025-03-17 06:14:44,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:14:44,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-90.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:14:44,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:14:44,833 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;@1b081a11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:14:44,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:14:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 06:14:44,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:44,845 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:44,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:44,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash -682474901, now seen corresponding path program 1 times [2025-03-17 06:14:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029627025] [2025-03-17 06:14:44,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:44,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 06:14:44,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 06:14:44,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:44,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 06:14:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029627025] [2025-03-17 06:14:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029627025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655004710] [2025-03-17 06:14:45,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:45,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:45,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:45,164 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-17 06:14:45,166 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-17 06:14:45,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 06:14:45,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 06:14:45,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:45,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:45,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:14:45,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 06:14:45,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:45,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655004710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:45,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:14:45,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:14:45,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474609588] [2025-03-17 06:14:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:14:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:45,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:14:45,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:14:45,377 INFO L87 Difference]: Start difference. First operand has 105 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:14:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:45,401 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2025-03-17 06:14:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:14:45,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 149 [2025-03-17 06:14:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:45,409 INFO L225 Difference]: With dead ends: 207 [2025-03-17 06:14:45,409 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 06:14:45,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-17 06:14:45,413 INFO L435 NwaCegarLoop]: 150 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, 150 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-17 06:14:45,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 06:14:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 06:14:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2025-03-17 06:14:45,442 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 149 [2025-03-17 06:14:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:45,442 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2025-03-17 06:14:45,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:14:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2025-03-17 06:14:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 06:14:45,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:45,444 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:45,451 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-17 06:14:45,645 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-17 06:14:45,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 232358143, now seen corresponding path program 1 times [2025-03-17 06:14:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80690187] [2025-03-17 06:14:45,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 06:14:45,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 06:14:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:14:46,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:46,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80690187] [2025-03-17 06:14:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80690187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:46,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836508261] [2025-03-17 06:14:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:46,019 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-17 06:14:46,020 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-17 06:14:46,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 06:14:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 06:14:46,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:46,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:46,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:14:46,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:14:46,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836508261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:14:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:14:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324531119] [2025-03-17 06:14:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:46,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:14:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:46,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:14:46,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:14:46,218 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:14:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:46,254 INFO L93 Difference]: Finished difference Result 207 states and 302 transitions. [2025-03-17 06:14:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:14:46,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2025-03-17 06:14:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:46,258 INFO L225 Difference]: With dead ends: 207 [2025-03-17 06:14:46,258 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 06:14:46,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:14:46,259 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:46,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 06:14:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 06:14:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2025-03-17 06:14:46,268 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 149 [2025-03-17 06:14:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:46,269 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2025-03-17 06:14:46,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:14:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2025-03-17 06:14:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 06:14:46,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:46,272 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:46,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:14:46,473 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,SelfDestructingSolverStorable1 [2025-03-17 06:14:46,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:46,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash -135780099, now seen corresponding path program 1 times [2025-03-17 06:14:46,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850687153] [2025-03-17 06:14:46,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:46,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:46,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 06:14:46,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 06:14:46,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:46,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:14:47,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:47,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850687153] [2025-03-17 06:14:47,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850687153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:47,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:47,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:14:47,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507844616] [2025-03-17 06:14:47,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:47,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:14:47,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:47,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:14:47,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:14:47,418 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:14:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:47,829 INFO L93 Difference]: Finished difference Result 245 states and 353 transitions. [2025-03-17 06:14:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:14:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-17 06:14:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:47,830 INFO L225 Difference]: With dead ends: 245 [2025-03-17 06:14:47,830 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 06:14:47,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:14:47,831 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 246 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:47,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 350 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:14:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 06:14:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 107. [2025-03-17 06:14:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2025-03-17 06:14:47,840 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 151 [2025-03-17 06:14:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:47,840 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2025-03-17 06:14:47,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:14:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2025-03-17 06:14:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:14:47,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:47,842 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:14:47,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash 254946074, now seen corresponding path program 1 times [2025-03-17 06:14:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412382622] [2025-03-17 06:14:47,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:47,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:14:47,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:14:47,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:47,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:14:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412382622] [2025-03-17 06:14:49,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412382622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:49,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:49,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:14:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636503912] [2025-03-17 06:14:49,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:49,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:14:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:49,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:14:49,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:14:49,699 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:14:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:50,329 INFO L93 Difference]: Finished difference Result 264 states and 378 transitions. [2025-03-17 06:14:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:14:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 152 [2025-03-17 06:14:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:50,334 INFO L225 Difference]: With dead ends: 264 [2025-03-17 06:14:50,336 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 06:14:50,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:14:50,338 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 218 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:50,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 564 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:14:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 06:14:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2025-03-17 06:14:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2025-03-17 06:14:50,365 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 152 [2025-03-17 06:14:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:50,365 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2025-03-17 06:14:50,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:14:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2025-03-17 06:14:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:14:50,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:50,367 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:50,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:14:50,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:50,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash 877912014, now seen corresponding path program 1 times [2025-03-17 06:14:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:50,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298153692] [2025-03-17 06:14:50,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:50,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:14:50,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:14:50,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:50,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:14:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298153692] [2025-03-17 06:14:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298153692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:14:52,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110184984] [2025-03-17 06:14:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:52,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:14:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:52,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:14:52,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:14:52,146 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:14:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:52,705 INFO L93 Difference]: Finished difference Result 288 states and 410 transitions. [2025-03-17 06:14:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:14:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2025-03-17 06:14:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:52,708 INFO L225 Difference]: With dead ends: 288 [2025-03-17 06:14:52,708 INFO L226 Difference]: Without dead ends: 163 [2025-03-17 06:14:52,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:14:52,710 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 267 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:52,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 515 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:14:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-17 06:14:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 114. [2025-03-17 06:14:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2025-03-17 06:14:52,732 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 153 [2025-03-17 06:14:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:52,734 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2025-03-17 06:14:52,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:14:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2025-03-17 06:14:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:14:52,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:52,735 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:52,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:14:52,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash 874047099, now seen corresponding path program 1 times [2025-03-17 06:14:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070220898] [2025-03-17 06:14:52,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:14:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:14:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-17 06:14:53,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070220898] [2025-03-17 06:14:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070220898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607388082] [2025-03-17 06:14:53,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:53,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:53,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:53,942 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-17 06:14:53,944 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-17 06:14:54,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:14:54,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:14:54,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:54,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:54,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 06:14:54,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:55,363 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 0 case distinctions, treesize of input 153 treesize of output 109 [2025-03-17 06:14:55,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:14:55,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:14:55,376 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 06:14:55,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 109 [2025-03-17 06:14:55,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:14:55,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:14:55,451 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 06:14:55,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 42 [2025-03-17 06:14:55,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:14:55,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 113 [2025-03-17 06:14:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:14:55,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:14:56,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:14:56,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 102 [2025-03-17 06:14:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:14:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607388082] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:14:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 10] total 27 [2025-03-17 06:14:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324455059] [2025-03-17 06:14:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:56,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:14:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:56,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:14:56,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2025-03-17 06:14:56,794 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:14:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:57,436 INFO L93 Difference]: Finished difference Result 271 states and 386 transitions. [2025-03-17 06:14:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:14:57,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 06:14:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:57,437 INFO L225 Difference]: With dead ends: 271 [2025-03-17 06:14:57,437 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 06:14:57,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 06:14:57,438 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 185 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:57,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 686 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:14:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 06:14:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2025-03-17 06:14:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2025-03-17 06:14:57,447 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 153 [2025-03-17 06:14:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:57,448 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2025-03-17 06:14:57,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:14:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2025-03-17 06:14:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:14:57,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:57,450 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:57,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:14:57,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:57,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:57,656 INFO L85 PathProgramCache]: Analyzing trace with hash 368488474, now seen corresponding path program 1 times [2025-03-17 06:14:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971799984] [2025-03-17 06:14:57,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:57,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:14:57,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:14:57,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:57,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:14:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971799984] [2025-03-17 06:14:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971799984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:59,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:14:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445094018] [2025-03-17 06:14:59,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:59,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:14:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:59,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:14:59,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:14:59,149 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:14:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:59,634 INFO L93 Difference]: Finished difference Result 271 states and 386 transitions. [2025-03-17 06:14:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:14:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2025-03-17 06:14:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:59,638 INFO L225 Difference]: With dead ends: 271 [2025-03-17 06:14:59,640 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 06:14:59,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:14:59,641 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 338 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:59,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 393 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:14:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 06:14:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2025-03-17 06:14:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 97 states have internal predecessors, (129), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:14:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2025-03-17 06:14:59,659 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 153 [2025-03-17 06:14:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:59,660 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2025-03-17 06:14:59,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:14:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2025-03-17 06:14:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:14:59,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:59,661 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:14:59,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:14:59,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:59,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash -123025254, now seen corresponding path program 1 times [2025-03-17 06:14:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:59,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207832367] [2025-03-17 06:14:59,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:59,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:59,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:14:59,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:14:59,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:59,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207832367] [2025-03-17 06:15:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207832367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:15:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282195903] [2025-03-17 06:15:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:01,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:15:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:01,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:15:01,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:15:01,054 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:01,542 INFO L93 Difference]: Finished difference Result 271 states and 384 transitions. [2025-03-17 06:15:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:15:01,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2025-03-17 06:15:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:01,544 INFO L225 Difference]: With dead ends: 271 [2025-03-17 06:15:01,544 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 06:15:01,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:15:01,545 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 395 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:01,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 344 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:15:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 06:15:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2025-03-17 06:15:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:15:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-03-17 06:15:01,557 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 153 [2025-03-17 06:15:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:01,557 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-03-17 06:15:01,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-03-17 06:15:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:15:01,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:01,558 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:01,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:15:01,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:01,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -628583879, now seen corresponding path program 1 times [2025-03-17 06:15:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314506150] [2025-03-17 06:15:01,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:01,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:01,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:15:01,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:15:01,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:03,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314506150] [2025-03-17 06:15:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314506150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:03,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 06:15:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326244774] [2025-03-17 06:15:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:03,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:15:03,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:03,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:15:03,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:15:03,489 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:05,203 INFO L93 Difference]: Finished difference Result 547 states and 758 transitions. [2025-03-17 06:15:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 06:15:05,203 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2025-03-17 06:15:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:05,205 INFO L225 Difference]: With dead ends: 547 [2025-03-17 06:15:05,205 INFO L226 Difference]: Without dead ends: 429 [2025-03-17 06:15:05,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 06:15:05,206 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 908 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:05,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1242 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:15:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-17 06:15:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 242. [2025-03-17 06:15:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.3025641025641026) internal successors, (254), 196 states have internal predecessors, (254), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 06:15:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2025-03-17 06:15:05,232 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 338 transitions. Word has length 153 [2025-03-17 06:15:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:05,233 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 338 transitions. [2025-03-17 06:15:05,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 338 transitions. [2025-03-17 06:15:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:15:05,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:05,234 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:05,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:15:05,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:05,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash -277783942, now seen corresponding path program 1 times [2025-03-17 06:15:05,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:05,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751988058] [2025-03-17 06:15:05,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:15:05,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:15:05,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:05,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751988058] [2025-03-17 06:15:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751988058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:15:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988463125] [2025-03-17 06:15:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:06,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:15:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:06,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:15:06,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:15:06,483 INFO L87 Difference]: Start difference. First operand 242 states and 338 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:07,672 INFO L93 Difference]: Finished difference Result 544 states and 757 transitions. [2025-03-17 06:15:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 06:15:07,673 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 06:15:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:07,676 INFO L225 Difference]: With dead ends: 544 [2025-03-17 06:15:07,676 INFO L226 Difference]: Without dead ends: 426 [2025-03-17 06:15:07,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2025-03-17 06:15:07,678 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 443 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:07,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1403 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:15:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-17 06:15:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 262. [2025-03-17 06:15:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 216 states have internal predecessors, (284), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 06:15:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 368 transitions. [2025-03-17 06:15:07,711 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 368 transitions. Word has length 153 [2025-03-17 06:15:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:07,712 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 368 transitions. [2025-03-17 06:15:07,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 368 transitions. [2025-03-17 06:15:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:07,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:07,713 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:07,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:15:07,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:07,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1503491077, now seen corresponding path program 1 times [2025-03-17 06:15:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379956559] [2025-03-17 06:15:07,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:07,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:07,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:07,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:07,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379956559] [2025-03-17 06:15:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379956559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-17 06:15:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266012338] [2025-03-17 06:15:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 06:15:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:11,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 06:15:11,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:15:11,778 INFO L87 Difference]: Start difference. First operand 262 states and 368 transitions. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 25 states have internal predecessors, (57), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-17 06:15:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:15,511 INFO L93 Difference]: Finished difference Result 610 states and 853 transitions. [2025-03-17 06:15:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 06:15:15,511 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 25 states have internal predecessors, (57), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 154 [2025-03-17 06:15:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:15,513 INFO L225 Difference]: With dead ends: 610 [2025-03-17 06:15:15,514 INFO L226 Difference]: Without dead ends: 492 [2025-03-17 06:15:15,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=324, Invalid=1656, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 06:15:15,515 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 951 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:15,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1685 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 06:15:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-17 06:15:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 262. [2025-03-17 06:15:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 216 states have internal predecessors, (284), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 06:15:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 368 transitions. [2025-03-17 06:15:15,547 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 368 transitions. Word has length 154 [2025-03-17 06:15:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:15,548 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 368 transitions. [2025-03-17 06:15:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 25 states have internal predecessors, (57), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-17 06:15:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 368 transitions. [2025-03-17 06:15:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:15,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:15,549 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:15,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:15:15,549 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1494818140, now seen corresponding path program 1 times [2025-03-17 06:15:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452227471] [2025-03-17 06:15:15,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:15,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:15,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:15,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:15,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:15,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452227471] [2025-03-17 06:15:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452227471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:15:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898596010] [2025-03-17 06:15:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:15:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:15,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:15:15,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:15:15,917 INFO L87 Difference]: Start difference. First operand 262 states and 368 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:16,269 INFO L93 Difference]: Finished difference Result 477 states and 670 transitions. [2025-03-17 06:15:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:16,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2025-03-17 06:15:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:16,271 INFO L225 Difference]: With dead ends: 477 [2025-03-17 06:15:16,271 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 06:15:16,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:15:16,272 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 291 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:16,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 356 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 06:15:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 262. [2025-03-17 06:15:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 216 states have internal predecessors, (279), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 06:15:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 363 transitions. [2025-03-17 06:15:16,310 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 363 transitions. Word has length 154 [2025-03-17 06:15:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:16,310 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 363 transitions. [2025-03-17 06:15:16,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 363 transitions. [2025-03-17 06:15:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:16,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:16,312 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:16,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:15:16,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:16,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash 779990975, now seen corresponding path program 1 times [2025-03-17 06:15:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904152135] [2025-03-17 06:15:16,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:16,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:16,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:16,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:16,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904152135] [2025-03-17 06:15:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904152135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:15:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469124007] [2025-03-17 06:15:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:15:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:16,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:15:16,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:15:16,633 INFO L87 Difference]: Start difference. First operand 262 states and 363 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:16,939 INFO L93 Difference]: Finished difference Result 502 states and 699 transitions. [2025-03-17 06:15:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:16,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 06:15:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:16,941 INFO L225 Difference]: With dead ends: 502 [2025-03-17 06:15:16,941 INFO L226 Difference]: Without dead ends: 349 [2025-03-17 06:15:16,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:15:16,942 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 297 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:16,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 356 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-17 06:15:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 284. [2025-03-17 06:15:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 237 states have (on average 1.3080168776371308) internal successors, (310), 238 states have internal predecessors, (310), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 06:15:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 394 transitions. [2025-03-17 06:15:16,979 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 394 transitions. Word has length 154 [2025-03-17 06:15:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 394 transitions. [2025-03-17 06:15:16,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 394 transitions. [2025-03-17 06:15:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:16,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:16,981 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:16,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:15:16,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2007424512, now seen corresponding path program 1 times [2025-03-17 06:15:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498834182] [2025-03-17 06:15:16,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:16,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:17,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:17,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:17,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498834182] [2025-03-17 06:15:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498834182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:15:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722277550] [2025-03-17 06:15:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:17,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:15:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:17,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:15:17,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:15:17,959 INFO L87 Difference]: Start difference. First operand 284 states and 394 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:18,353 INFO L93 Difference]: Finished difference Result 539 states and 750 transitions. [2025-03-17 06:15:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:15:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2025-03-17 06:15:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:18,355 INFO L225 Difference]: With dead ends: 539 [2025-03-17 06:15:18,356 INFO L226 Difference]: Without dead ends: 361 [2025-03-17 06:15:18,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:15:18,356 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 223 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:18,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 386 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-17 06:15:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 303. [2025-03-17 06:15:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 256 states have (on average 1.30859375) internal successors, (335), 257 states have internal predecessors, (335), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 06:15:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 419 transitions. [2025-03-17 06:15:18,431 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 419 transitions. Word has length 154 [2025-03-17 06:15:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:18,431 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 419 transitions. [2025-03-17 06:15:18,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 419 transitions. [2025-03-17 06:15:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:18,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:18,432 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:18,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:15:18,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1674513960, now seen corresponding path program 1 times [2025-03-17 06:15:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:18,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685307108] [2025-03-17 06:15:18,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:18,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:18,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:18,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:18,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:20,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685307108] [2025-03-17 06:15:20,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685307108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:20,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:20,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 06:15:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042318777] [2025-03-17 06:15:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:20,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:15:20,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:20,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:15:20,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:15:20,633 INFO L87 Difference]: Start difference. First operand 303 states and 419 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 06:15:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:21,978 INFO L93 Difference]: Finished difference Result 606 states and 831 transitions. [2025-03-17 06:15:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 06:15:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 154 [2025-03-17 06:15:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:21,981 INFO L225 Difference]: With dead ends: 606 [2025-03-17 06:15:21,981 INFO L226 Difference]: Without dead ends: 447 [2025-03-17 06:15:21,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2025-03-17 06:15:21,982 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 328 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:21,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1170 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:15:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-17 06:15:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 243. [2025-03-17 06:15:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 197 states have (on average 1.299492385786802) internal successors, (256), 197 states have internal predecessors, (256), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:15:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 336 transitions. [2025-03-17 06:15:22,041 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 336 transitions. Word has length 154 [2025-03-17 06:15:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:22,042 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 336 transitions. [2025-03-17 06:15:22,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 06:15:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 336 transitions. [2025-03-17 06:15:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:22,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:22,043 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:22,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:15:22,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:22,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash -506612764, now seen corresponding path program 1 times [2025-03-17 06:15:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:22,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940284035] [2025-03-17 06:15:22,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:22,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:22,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:22,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:22,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:23,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940284035] [2025-03-17 06:15:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940284035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:15:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894215940] [2025-03-17 06:15:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:23,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:15:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:23,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:15:23,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:15:23,413 INFO L87 Difference]: Start difference. First operand 243 states and 336 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:24,473 INFO L93 Difference]: Finished difference Result 643 states and 881 transitions. [2025-03-17 06:15:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 06:15:24,474 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 06:15:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:24,476 INFO L225 Difference]: With dead ends: 643 [2025-03-17 06:15:24,476 INFO L226 Difference]: Without dead ends: 471 [2025-03-17 06:15:24,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2025-03-17 06:15:24,477 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 464 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:24,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1123 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:15:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-17 06:15:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 243. [2025-03-17 06:15:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 197 states have (on average 1.299492385786802) internal successors, (256), 197 states have internal predecessors, (256), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:15:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 336 transitions. [2025-03-17 06:15:24,514 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 336 transitions. Word has length 154 [2025-03-17 06:15:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:24,514 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 336 transitions. [2025-03-17 06:15:24,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 336 transitions. [2025-03-17 06:15:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:24,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:24,515 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:24,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:15:24,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:24,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1230112866, now seen corresponding path program 1 times [2025-03-17 06:15:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651125006] [2025-03-17 06:15:24,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:24,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:24,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:24,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:24,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651125006] [2025-03-17 06:15:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651125006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:25,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:15:25,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824748958] [2025-03-17 06:15:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:25,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:15:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:25,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:15:25,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:15:25,476 INFO L87 Difference]: Start difference. First operand 243 states and 336 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:25,974 INFO L93 Difference]: Finished difference Result 479 states and 660 transitions. [2025-03-17 06:15:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:25,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2025-03-17 06:15:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:25,976 INFO L225 Difference]: With dead ends: 479 [2025-03-17 06:15:25,976 INFO L226 Difference]: Without dead ends: 307 [2025-03-17 06:15:25,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:15:25,976 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 292 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:25,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 414 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:15:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-17 06:15:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 268. [2025-03-17 06:15:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 222 states have (on average 1.3108108108108107) internal successors, (291), 222 states have internal predecessors, (291), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:15:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 371 transitions. [2025-03-17 06:15:26,010 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 371 transitions. Word has length 154 [2025-03-17 06:15:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:26,010 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 371 transitions. [2025-03-17 06:15:26,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 371 transitions. [2025-03-17 06:15:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:26,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:26,013 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:15:26,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 277438943, now seen corresponding path program 1 times [2025-03-17 06:15:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006428230] [2025-03-17 06:15:26,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:26,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:26,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:26,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:26,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:26,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:26,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006428230] [2025-03-17 06:15:26,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006428230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:26,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:26,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:15:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531117782] [2025-03-17 06:15:26,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:15:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:26,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:15:26,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:15:26,386 INFO L87 Difference]: Start difference. First operand 268 states and 371 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:26,710 INFO L93 Difference]: Finished difference Result 505 states and 694 transitions. [2025-03-17 06:15:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:26,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 06:15:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:26,713 INFO L225 Difference]: With dead ends: 505 [2025-03-17 06:15:26,713 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 06:15:26,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:15:26,714 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 157 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:26,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 512 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 06:15:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 286. [2025-03-17 06:15:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 240 states have (on average 1.3166666666666667) internal successors, (316), 240 states have internal predecessors, (316), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:15:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 396 transitions. [2025-03-17 06:15:26,770 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 396 transitions. Word has length 154 [2025-03-17 06:15:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 396 transitions. [2025-03-17 06:15:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 396 transitions. [2025-03-17 06:15:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:15:26,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:26,771 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:26,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:15:26,772 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:26,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash -335589881, now seen corresponding path program 1 times [2025-03-17 06:15:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:26,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230673138] [2025-03-17 06:15:26,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:26,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:26,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:26,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:26,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:15:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230673138] [2025-03-17 06:15:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230673138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:15:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054966771] [2025-03-17 06:15:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:29,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:15:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:15:29,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:15:29,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:15:29,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:15:29,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:15:29,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:29,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:29,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-17 06:15:29,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:15:30,079 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-17 06:15:30,301 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-17 06:15:30,509 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-17 06:15:30,709 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-17 06:15:30,907 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-17 06:15:31,118 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-17 06:15:31,350 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-17 06:15:31,576 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-17 06:15:31,657 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-17 06:15:31,704 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-17 06:15:31,770 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 0 case distinctions, treesize of input 64 treesize of output 43 [2025-03-17 06:15:31,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:31,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2025-03-17 06:15:31,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:31,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 24 [2025-03-17 06:15:31,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:15:31,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 65 [2025-03-17 06:15:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2025-03-17 06:15:31,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:15:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054966771] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:15:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:15:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [22, 14] total 36 [2025-03-17 06:15:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654241144] [2025-03-17 06:15:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:32,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:15:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:32,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:15:32,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 06:15:32,194 INFO L87 Difference]: Start difference. First operand 286 states and 396 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:32,540 INFO L93 Difference]: Finished difference Result 526 states and 724 transitions. [2025-03-17 06:15:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:15:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 06:15:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:32,542 INFO L225 Difference]: With dead ends: 526 [2025-03-17 06:15:32,542 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 06:15:32,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 300 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=1422, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 06:15:32,543 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 50 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:32,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 948 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:15:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 06:15:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 214. [2025-03-17 06:15:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 292 transitions. [2025-03-17 06:15:32,570 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 292 transitions. Word has length 154 [2025-03-17 06:15:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:32,570 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 292 transitions. [2025-03-17 06:15:32,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 292 transitions. [2025-03-17 06:15:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:15:32,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:32,572 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:32,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:15:32,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:15:32,772 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1845162125, now seen corresponding path program 1 times [2025-03-17 06:15:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265875376] [2025-03-17 06:15:32,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:15:32,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:15:32,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:32,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:33,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265875376] [2025-03-17 06:15:33,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265875376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:33,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:33,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:15:33,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763375344] [2025-03-17 06:15:33,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:33,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:15:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:33,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:15:33,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:15:33,158 INFO L87 Difference]: Start difference. First operand 214 states and 292 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:33,451 INFO L93 Difference]: Finished difference Result 465 states and 636 transitions. [2025-03-17 06:15:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:33,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-03-17 06:15:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:33,455 INFO L225 Difference]: With dead ends: 465 [2025-03-17 06:15:33,456 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 06:15:33,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:15:33,457 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 302 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:33,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 351 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:15:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 06:15:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 229. [2025-03-17 06:15:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.3181818181818181) internal successors, (261), 199 states have internal predecessors, (261), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 313 transitions. [2025-03-17 06:15:33,487 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 313 transitions. Word has length 155 [2025-03-17 06:15:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:33,487 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 313 transitions. [2025-03-17 06:15:33,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 313 transitions. [2025-03-17 06:15:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:15:33,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:33,489 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:33,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:15:33,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash -337610316, now seen corresponding path program 1 times [2025-03-17 06:15:33,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:33,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465329079] [2025-03-17 06:15:33,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:33,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:15:33,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:15:33,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:33,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:34,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465329079] [2025-03-17 06:15:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465329079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:15:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306997527] [2025-03-17 06:15:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:34,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:15:34,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:34,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:15:34,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:15:34,571 INFO L87 Difference]: Start difference. First operand 229 states and 313 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:35,012 INFO L93 Difference]: Finished difference Result 494 states and 676 transitions. [2025-03-17 06:15:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:35,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2025-03-17 06:15:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:35,014 INFO L225 Difference]: With dead ends: 494 [2025-03-17 06:15:35,014 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 06:15:35,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:15:35,015 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 473 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:35,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 315 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 06:15:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 214. [2025-03-17 06:15:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 292 transitions. [2025-03-17 06:15:35,051 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 292 transitions. Word has length 155 [2025-03-17 06:15:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:35,051 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 292 transitions. [2025-03-17 06:15:35,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:15:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 292 transitions. [2025-03-17 06:15:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:15:35,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:35,052 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:35,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:15:35,052 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:35,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash -838420048, now seen corresponding path program 1 times [2025-03-17 06:15:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:35,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224726169] [2025-03-17 06:15:35,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:35,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:15:35,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:15:35,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:35,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:36,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224726169] [2025-03-17 06:15:36,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224726169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:36,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:15:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559381929] [2025-03-17 06:15:36,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:36,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:15:36,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:36,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:15:36,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:15:36,195 INFO L87 Difference]: Start difference. First operand 214 states and 292 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:37,533 INFO L93 Difference]: Finished difference Result 483 states and 658 transitions. [2025-03-17 06:15:37,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:15:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2025-03-17 06:15:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:37,536 INFO L225 Difference]: With dead ends: 483 [2025-03-17 06:15:37,536 INFO L226 Difference]: Without dead ends: 286 [2025-03-17 06:15:37,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:15:37,542 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 295 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:37,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 653 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:15:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-17 06:15:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2025-03-17 06:15:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 201 states have (on average 1.318407960199005) internal successors, (265), 202 states have internal predecessors, (265), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2025-03-17 06:15:37,584 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 317 transitions. Word has length 155 [2025-03-17 06:15:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:37,585 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 317 transitions. [2025-03-17 06:15:37,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 317 transitions. [2025-03-17 06:15:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:15:37,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:37,590 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:37,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 06:15:37,590 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash 266128244, now seen corresponding path program 1 times [2025-03-17 06:15:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36512399] [2025-03-17 06:15:37,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:37,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:15:37,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:15:37,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:37,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36512399] [2025-03-17 06:15:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36512399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:38,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:15:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948073235] [2025-03-17 06:15:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:15:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:38,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:15:38,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:15:38,393 INFO L87 Difference]: Start difference. First operand 232 states and 317 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:38,760 INFO L93 Difference]: Finished difference Result 488 states and 668 transitions. [2025-03-17 06:15:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:15:38,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-03-17 06:15:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:38,762 INFO L225 Difference]: With dead ends: 488 [2025-03-17 06:15:38,762 INFO L226 Difference]: Without dead ends: 273 [2025-03-17 06:15:38,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:15:38,763 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 254 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:38,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 400 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-17 06:15:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 232. [2025-03-17 06:15:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-03-17 06:15:38,801 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 155 [2025-03-17 06:15:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-03-17 06:15:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-03-17 06:15:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:15:38,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:38,802 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:38,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 06:15:38,803 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:38,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1773680053, now seen corresponding path program 1 times [2025-03-17 06:15:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:38,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379497038] [2025-03-17 06:15:38,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:38,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:15:38,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:15:38,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:38,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379497038] [2025-03-17 06:15:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379497038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:39,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:39,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:15:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113618489] [2025-03-17 06:15:39,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:39,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:15:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:39,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:15:39,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:15:39,183 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:39,512 INFO L93 Difference]: Finished difference Result 493 states and 671 transitions. [2025-03-17 06:15:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-03-17 06:15:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:39,513 INFO L225 Difference]: With dead ends: 493 [2025-03-17 06:15:39,513 INFO L226 Difference]: Without dead ends: 278 [2025-03-17 06:15:39,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:15:39,514 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 161 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:39,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 502 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-17 06:15:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 232. [2025-03-17 06:15:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-03-17 06:15:39,558 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 155 [2025-03-17 06:15:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:39,558 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-03-17 06:15:39,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-03-17 06:15:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:39,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:39,560 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:39,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 06:15:39,560 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -88800226, now seen corresponding path program 1 times [2025-03-17 06:15:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396614849] [2025-03-17 06:15:39,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:39,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:39,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:39,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:39,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:40,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396614849] [2025-03-17 06:15:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396614849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:15:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425832955] [2025-03-17 06:15:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:40,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:15:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:40,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:15:40,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:15:40,364 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:40,686 INFO L93 Difference]: Finished difference Result 531 states and 719 transitions. [2025-03-17 06:15:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 06:15:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:40,688 INFO L225 Difference]: With dead ends: 531 [2025-03-17 06:15:40,688 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 06:15:40,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:15:40,689 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 227 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:40,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 506 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:15:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 06:15:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 265. [2025-03-17 06:15:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 235 states have internal predecessors, (309), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 361 transitions. [2025-03-17 06:15:40,719 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 361 transitions. Word has length 156 [2025-03-17 06:15:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:40,719 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 361 transitions. [2025-03-17 06:15:40,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 361 transitions. [2025-03-17 06:15:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:40,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:40,720 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:40,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 06:15:40,720 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:40,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -535378253, now seen corresponding path program 1 times [2025-03-17 06:15:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764297740] [2025-03-17 06:15:40,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:40,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:40,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:40,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:40,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:41,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764297740] [2025-03-17 06:15:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764297740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:41,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:15:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565809471] [2025-03-17 06:15:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:41,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:15:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:41,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:15:41,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:15:41,593 INFO L87 Difference]: Start difference. First operand 265 states and 361 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:41,916 INFO L93 Difference]: Finished difference Result 617 states and 835 transitions. [2025-03-17 06:15:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:41,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2025-03-17 06:15:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:41,918 INFO L225 Difference]: With dead ends: 617 [2025-03-17 06:15:41,918 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 06:15:41,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:15:41,919 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 664 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:41,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 295 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:15:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 06:15:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 343. [2025-03-17 06:15:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 312 states have (on average 1.310897435897436) internal successors, (409), 313 states have internal predecessors, (409), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 461 transitions. [2025-03-17 06:15:41,950 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 461 transitions. Word has length 156 [2025-03-17 06:15:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:41,951 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 461 transitions. [2025-03-17 06:15:41,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 461 transitions. [2025-03-17 06:15:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:41,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:41,952 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:41,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 06:15:41,953 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:41,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash 129167094, now seen corresponding path program 1 times [2025-03-17 06:15:41,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:41,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723184720] [2025-03-17 06:15:41,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:41,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:41,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:41,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:41,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:41,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:43,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:43,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723184720] [2025-03-17 06:15:43,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723184720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:43,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:43,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:15:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659946127] [2025-03-17 06:15:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:43,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:15:43,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:43,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:15:43,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:15:43,021 INFO L87 Difference]: Start difference. First operand 343 states and 461 transitions. Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 06:15:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:43,949 INFO L93 Difference]: Finished difference Result 727 states and 981 transitions. [2025-03-17 06:15:43,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:15:43,949 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 156 [2025-03-17 06:15:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:43,951 INFO L225 Difference]: With dead ends: 727 [2025-03-17 06:15:43,951 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 06:15:43,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2025-03-17 06:15:43,952 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 466 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:43,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 710 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:15:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 06:15:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 348. [2025-03-17 06:15:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 317 states have (on average 1.3091482649842272) internal successors, (415), 318 states have internal predecessors, (415), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:15:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 467 transitions. [2025-03-17 06:15:43,990 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 467 transitions. Word has length 156 [2025-03-17 06:15:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:43,990 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 467 transitions. [2025-03-17 06:15:43,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 06:15:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 467 transitions. [2025-03-17 06:15:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:43,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:43,991 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:43,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 06:15:43,991 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:43,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1667784265, now seen corresponding path program 1 times [2025-03-17 06:15:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855028583] [2025-03-17 06:15:43,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:44,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:44,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:44,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:44,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:44,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:44,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855028583] [2025-03-17 06:15:44,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855028583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:44,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:44,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:15:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595261309] [2025-03-17 06:15:44,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:44,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:15:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:44,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:15:44,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:15:44,753 INFO L87 Difference]: Start difference. First operand 348 states and 467 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:45,186 INFO L93 Difference]: Finished difference Result 829 states and 1101 transitions. [2025-03-17 06:15:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2025-03-17 06:15:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:45,188 INFO L225 Difference]: With dead ends: 829 [2025-03-17 06:15:45,188 INFO L226 Difference]: Without dead ends: 498 [2025-03-17 06:15:45,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:15:45,189 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 253 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:45,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 389 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-17 06:15:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 489. [2025-03-17 06:15:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 443 states have (on average 1.2844243792325056) internal successors, (569), 445 states have internal predecessors, (569), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 06:15:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 645 transitions. [2025-03-17 06:15:45,247 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 645 transitions. Word has length 156 [2025-03-17 06:15:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:45,247 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 645 transitions. [2025-03-17 06:15:45,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 645 transitions. [2025-03-17 06:15:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:45,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:45,248 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:45,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 06:15:45,249 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:45,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash -706170248, now seen corresponding path program 1 times [2025-03-17 06:15:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:45,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503535856] [2025-03-17 06:15:45,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:45,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:45,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:45,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:45,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503535856] [2025-03-17 06:15:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503535856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:15:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079684591] [2025-03-17 06:15:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:45,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:15:45,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:45,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:15:45,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:15:45,431 INFO L87 Difference]: Start difference. First operand 489 states and 645 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:45,607 INFO L93 Difference]: Finished difference Result 916 states and 1218 transitions. [2025-03-17 06:15:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:15:45,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 06:15:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:45,609 INFO L225 Difference]: With dead ends: 916 [2025-03-17 06:15:45,609 INFO L226 Difference]: Without dead ends: 444 [2025-03-17 06:15:45,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:15:45,610 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 103 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:45,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 418 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:15:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-17 06:15:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 408. [2025-03-17 06:15:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 362 states have (on average 1.2900552486187846) internal successors, (467), 364 states have internal predecessors, (467), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 06:15:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 543 transitions. [2025-03-17 06:15:45,667 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 543 transitions. Word has length 156 [2025-03-17 06:15:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:45,668 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 543 transitions. [2025-03-17 06:15:45,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 543 transitions. [2025-03-17 06:15:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:45,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:45,669 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:45,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 06:15:45,669 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:45,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1878756433, now seen corresponding path program 1 times [2025-03-17 06:15:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772443755] [2025-03-17 06:15:45,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:45,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:45,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:45,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:45,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:46,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:46,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772443755] [2025-03-17 06:15:46,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772443755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:46,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:46,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:15:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752581415] [2025-03-17 06:15:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:15:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:46,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:15:46,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:15:46,273 INFO L87 Difference]: Start difference. First operand 408 states and 543 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 06:15:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:46,774 INFO L93 Difference]: Finished difference Result 957 states and 1267 transitions. [2025-03-17 06:15:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:46,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 156 [2025-03-17 06:15:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:46,776 INFO L225 Difference]: With dead ends: 957 [2025-03-17 06:15:46,776 INFO L226 Difference]: Without dead ends: 566 [2025-03-17 06:15:46,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:15:46,777 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 379 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:46,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 360 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-17 06:15:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-03-17 06:15:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 492 states have (on average 1.274390243902439) internal successors, (627), 495 states have internal predecessors, (627), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:15:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 735 transitions. [2025-03-17 06:15:46,865 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 735 transitions. Word has length 156 [2025-03-17 06:15:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:46,866 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 735 transitions. [2025-03-17 06:15:46,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 06:15:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 735 transitions. [2025-03-17 06:15:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:46,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:46,867 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 06:15:46,867 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -81805074, now seen corresponding path program 1 times [2025-03-17 06:15:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412366311] [2025-03-17 06:15:46,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:46,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:46,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:46,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412366311] [2025-03-17 06:15:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412366311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:15:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784154210] [2025-03-17 06:15:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:47,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:15:47,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:47,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:15:47,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:15:47,854 INFO L87 Difference]: Start difference. First operand 557 states and 735 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:48,757 INFO L93 Difference]: Finished difference Result 1172 states and 1553 transitions. [2025-03-17 06:15:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:15:48,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2025-03-17 06:15:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:48,760 INFO L225 Difference]: With dead ends: 1172 [2025-03-17 06:15:48,760 INFO L226 Difference]: Without dead ends: 632 [2025-03-17 06:15:48,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:15:48,761 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 405 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:48,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 734 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:15:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-17 06:15:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 577. [2025-03-17 06:15:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 512 states have (on average 1.275390625) internal successors, (653), 515 states have internal predecessors, (653), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:15:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 761 transitions. [2025-03-17 06:15:48,856 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 761 transitions. Word has length 156 [2025-03-17 06:15:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:48,857 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 761 transitions. [2025-03-17 06:15:48,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 761 transitions. [2025-03-17 06:15:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:48,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:48,858 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:48,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 06:15:48,858 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:48,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1214211086, now seen corresponding path program 1 times [2025-03-17 06:15:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:48,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853925729] [2025-03-17 06:15:48,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:48,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:48,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:48,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:48,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:49,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853925729] [2025-03-17 06:15:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853925729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:15:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423746018] [2025-03-17 06:15:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:15:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:49,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:15:49,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:15:49,870 INFO L87 Difference]: Start difference. First operand 577 states and 761 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:50,286 INFO L93 Difference]: Finished difference Result 1159 states and 1528 transitions. [2025-03-17 06:15:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2025-03-17 06:15:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:50,289 INFO L225 Difference]: With dead ends: 1159 [2025-03-17 06:15:50,289 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 06:15:50,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:15:50,290 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 429 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:50,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 369 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 06:15:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 574. [2025-03-17 06:15:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 509 states have (on average 1.2711198428290766) internal successors, (647), 512 states have internal predecessors, (647), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:15:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 755 transitions. [2025-03-17 06:15:50,387 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 755 transitions. Word has length 156 [2025-03-17 06:15:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 755 transitions. [2025-03-17 06:15:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 755 transitions. [2025-03-17 06:15:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:50,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:50,389 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:50,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 06:15:50,389 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:50,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -917142416, now seen corresponding path program 1 times [2025-03-17 06:15:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:50,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373683268] [2025-03-17 06:15:50,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:50,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:50,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:50,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:50,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373683268] [2025-03-17 06:15:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373683268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:50,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:15:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435982271] [2025-03-17 06:15:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:50,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:15:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:50,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:15:50,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:15:50,556 INFO L87 Difference]: Start difference. First operand 574 states and 755 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:50,777 INFO L93 Difference]: Finished difference Result 1086 states and 1438 transitions. [2025-03-17 06:15:50,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:15:50,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 06:15:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:50,780 INFO L225 Difference]: With dead ends: 1086 [2025-03-17 06:15:50,780 INFO L226 Difference]: Without dead ends: 529 [2025-03-17 06:15:50,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:15:50,781 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 103 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:50,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 418 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:15:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-17 06:15:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 485. [2025-03-17 06:15:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 420 states have (on average 1.2738095238095237) internal successors, (535), 423 states have internal predecessors, (535), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:15:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 643 transitions. [2025-03-17 06:15:50,866 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 643 transitions. Word has length 156 [2025-03-17 06:15:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:50,867 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 643 transitions. [2025-03-17 06:15:50,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 643 transitions. [2025-03-17 06:15:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:15:50,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:50,868 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:50,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 06:15:50,868 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:50,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash -476296286, now seen corresponding path program 1 times [2025-03-17 06:15:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:50,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404838807] [2025-03-17 06:15:50,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:50,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:50,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:15:50,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:15:50,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:50,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:52,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:52,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404838807] [2025-03-17 06:15:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404838807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:52,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:15:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755495280] [2025-03-17 06:15:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:52,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:15:52,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:52,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:15:52,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:15:52,024 INFO L87 Difference]: Start difference. First operand 485 states and 643 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:52,723 INFO L93 Difference]: Finished difference Result 963 states and 1275 transitions. [2025-03-17 06:15:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:15:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:15:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:52,725 INFO L225 Difference]: With dead ends: 963 [2025-03-17 06:15:52,725 INFO L226 Difference]: Without dead ends: 495 [2025-03-17 06:15:52,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:15:52,726 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 260 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:52,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 562 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:15:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-17 06:15:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 461. [2025-03-17 06:15:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 396 states have (on average 1.2803030303030303) internal successors, (507), 399 states have internal predecessors, (507), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:15:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 615 transitions. [2025-03-17 06:15:52,812 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 615 transitions. Word has length 156 [2025-03-17 06:15:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:52,813 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 615 transitions. [2025-03-17 06:15:52,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:15:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 615 transitions. [2025-03-17 06:15:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 06:15:52,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:52,814 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:52,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 06:15:52,814 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:52,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1715126574, now seen corresponding path program 1 times [2025-03-17 06:15:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404496279] [2025-03-17 06:15:52,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:52,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 06:15:52,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 06:15:52,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:52,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:54,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404496279] [2025-03-17 06:15:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404496279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:15:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166227999] [2025-03-17 06:15:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:54,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:15:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:54,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:15:54,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:15:54,428 INFO L87 Difference]: Start difference. First operand 461 states and 615 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:54,874 INFO L93 Difference]: Finished difference Result 914 states and 1218 transitions. [2025-03-17 06:15:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:15:54,875 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2025-03-17 06:15:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:54,877 INFO L225 Difference]: With dead ends: 914 [2025-03-17 06:15:54,877 INFO L226 Difference]: Without dead ends: 470 [2025-03-17 06:15:54,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:15:54,878 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 400 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:54,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 353 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:15:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-17 06:15:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 385. [2025-03-17 06:15:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 320 states have (on average 1.246875) internal successors, (399), 323 states have internal predecessors, (399), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:15:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 507 transitions. [2025-03-17 06:15:54,965 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 507 transitions. Word has length 157 [2025-03-17 06:15:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:54,965 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 507 transitions. [2025-03-17 06:15:54,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 507 transitions. [2025-03-17 06:15:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 06:15:54,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:54,966 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:54,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 06:15:54,966 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1101747088, now seen corresponding path program 1 times [2025-03-17 06:15:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271157728] [2025-03-17 06:15:54,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:54,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:54,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 06:15:54,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 06:15:54,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:54,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271157728] [2025-03-17 06:15:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271157728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:15:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892613506] [2025-03-17 06:15:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:55,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:15:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:55,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:15:55,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:15:55,124 INFO L87 Difference]: Start difference. First operand 385 states and 507 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:55,343 INFO L93 Difference]: Finished difference Result 1028 states and 1357 transitions. [2025-03-17 06:15:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:15:55,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-17 06:15:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:55,346 INFO L225 Difference]: With dead ends: 1028 [2025-03-17 06:15:55,346 INFO L226 Difference]: Without dead ends: 660 [2025-03-17 06:15:55,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:15:55,347 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 83 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:55,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 345 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:15:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-17 06:15:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 547. [2025-03-17 06:15:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 466 states have (on average 1.2768240343347639) internal successors, (595), 468 states have internal predecessors, (595), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 06:15:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 731 transitions. [2025-03-17 06:15:55,452 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 731 transitions. Word has length 157 [2025-03-17 06:15:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:55,452 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 731 transitions. [2025-03-17 06:15:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 731 transitions. [2025-03-17 06:15:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 06:15:55,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:55,453 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:55,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 06:15:55,453 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1607305713, now seen corresponding path program 1 times [2025-03-17 06:15:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077509401] [2025-03-17 06:15:55,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:55,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 06:15:55,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 06:15:55,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:55,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:56,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077509401] [2025-03-17 06:15:56,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077509401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:56,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:56,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:15:56,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122168238] [2025-03-17 06:15:56,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:56,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:15:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:56,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:15:56,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:15:56,596 INFO L87 Difference]: Start difference. First operand 547 states and 731 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:57,321 INFO L93 Difference]: Finished difference Result 1177 states and 1567 transitions. [2025-03-17 06:15:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:15:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2025-03-17 06:15:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:57,324 INFO L225 Difference]: With dead ends: 1177 [2025-03-17 06:15:57,324 INFO L226 Difference]: Without dead ends: 807 [2025-03-17 06:15:57,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:15:57,325 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 305 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:57,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 455 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:15:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-03-17 06:15:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 639. [2025-03-17 06:15:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 558 states have (on average 1.299283154121864) internal successors, (725), 560 states have internal predecessors, (725), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 06:15:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 861 transitions. [2025-03-17 06:15:57,436 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 861 transitions. Word has length 157 [2025-03-17 06:15:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:57,436 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 861 transitions. [2025-03-17 06:15:57,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:15:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 861 transitions. [2025-03-17 06:15:57,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:15:57,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:57,437 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:57,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 06:15:57,437 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:57,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:57,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1152278467, now seen corresponding path program 1 times [2025-03-17 06:15:57,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:57,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470305231] [2025-03-17 06:15:57,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:57,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:15:57,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:15:57,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:57,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470305231] [2025-03-17 06:15:57,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470305231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:57,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:57,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:15:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182119734] [2025-03-17 06:15:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:57,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:15:57,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:57,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:15:57,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:15:57,941 INFO L87 Difference]: Start difference. First operand 639 states and 861 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:58,394 INFO L93 Difference]: Finished difference Result 1228 states and 1634 transitions. [2025-03-17 06:15:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:15:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 06:15:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:58,398 INFO L225 Difference]: With dead ends: 1228 [2025-03-17 06:15:58,398 INFO L226 Difference]: Without dead ends: 800 [2025-03-17 06:15:58,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:15:58,399 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 300 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:58,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 400 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-17 06:15:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 706. [2025-03-17 06:15:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 625 states have (on average 1.2992) internal successors, (812), 627 states have internal predecessors, (812), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 06:15:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 948 transitions. [2025-03-17 06:15:58,512 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 948 transitions. Word has length 158 [2025-03-17 06:15:58,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:58,512 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 948 transitions. [2025-03-17 06:15:58,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:15:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 948 transitions. [2025-03-17 06:15:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:15:58,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:58,513 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:15:58,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 06:15:58,514 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:58,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1635137020, now seen corresponding path program 1 times [2025-03-17 06:15:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:58,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608972949] [2025-03-17 06:15:58,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:58,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:58,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:15:58,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:15:58,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:58,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:15:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608972949] [2025-03-17 06:15:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608972949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:59,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:15:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228164296] [2025-03-17 06:15:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:59,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:15:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:59,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:15:59,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:15:59,904 INFO L87 Difference]: Start difference. First operand 706 states and 948 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:16:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:00,511 INFO L93 Difference]: Finished difference Result 1380 states and 1831 transitions. [2025-03-17 06:16:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:16:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 158 [2025-03-17 06:16:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:00,515 INFO L225 Difference]: With dead ends: 1380 [2025-03-17 06:16:00,515 INFO L226 Difference]: Without dead ends: 917 [2025-03-17 06:16:00,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:16:00,516 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 371 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:00,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 335 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:16:00,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-03-17 06:16:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 739. [2025-03-17 06:16:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 658 states have (on average 1.2948328267477203) internal successors, (852), 660 states have internal predecessors, (852), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 06:16:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 988 transitions. [2025-03-17 06:16:00,628 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 988 transitions. Word has length 158 [2025-03-17 06:16:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:00,628 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 988 transitions. [2025-03-17 06:16:00,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:16:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 988 transitions. [2025-03-17 06:16:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:16:00,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:00,629 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:16:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 06:16:00,629 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:00,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1678353292, now seen corresponding path program 1 times [2025-03-17 06:16:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:16:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869215665] [2025-03-17 06:16:00,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:16:00,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:16:00,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:16:00,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:00,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:16:01,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:16:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869215665] [2025-03-17 06:16:01,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869215665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:01,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:16:01,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:16:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540240464] [2025-03-17 06:16:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:01,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:16:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:16:01,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:16:01,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:16:01,437 INFO L87 Difference]: Start difference. First operand 739 states and 988 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20)