./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.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 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:56:32,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:56:32,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:56:32,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:56:32,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:56:32,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:56:32,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:56:32,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:56:32,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:56:32,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:56:32,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:56:32,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:56:32,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:56:32,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:56:32,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:56:32,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:56:32,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:56:32,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:56:32,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:56:32,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:56:32,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:56:32,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:56:32,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:56:32,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:56:32,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:56:32,929 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 -> 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 [2025-03-04 01:56:33,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:56:33,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:56:33,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:56:33,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:56:33,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:56:33,202 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-88.i [2025-03-04 01:56:34,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2897778/2e46df4040f14f5788165cdae40ed47d/FLAGc6b80d7f1 [2025-03-04 01:56:34,731 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:56:34,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2025-03-04 01:56:34,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2897778/2e46df4040f14f5788165cdae40ed47d/FLAGc6b80d7f1 [2025-03-04 01:56:35,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2897778/2e46df4040f14f5788165cdae40ed47d [2025-03-04 01:56:35,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:56:35,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:56:35,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:56:35,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:56:35,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:56:35,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b263501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35, skipping insertion in model container [2025-03-04 01:56:35,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:56:35,194 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-88.i[917,930] [2025-03-04 01:56:35,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:56:35,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:56:35,250 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-88.i[917,930] [2025-03-04 01:56:35,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:56:35,301 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:56:35,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35 WrapperNode [2025-03-04 01:56:35,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:56:35,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:56:35,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:56:35,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:56:35,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,343 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 534 [2025-03-04 01:56:35,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:56:35,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:56:35,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:56:35,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:56:35,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,369 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:56:35,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:56:35,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:56:35,387 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:56:35,387 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:56:35,388 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (1/1) ... [2025-03-04 01:56:35,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:56:35,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:56:35,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:56:35,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:56:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:56:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:56:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:56:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:56:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:56:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:56:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:56:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:56:35,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:56:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:56:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:56:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:56:35,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:56:35,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:56:36,021 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: havoc property_#t~bitwise79#1;havoc property_#t~mem80#1;havoc property_#t~short81#1;havoc property_#t~ite92#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-04 01:56:36,062 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-04 01:56:36,063 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:56:36,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:56:36,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:56:36,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:56:36 BoogieIcfgContainer [2025-03-04 01:56:36,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:56:36,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:56:36,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:56:36,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:56:36,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:56:35" (1/3) ... [2025-03-04 01:56:36,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a4fcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:56:36, skipping insertion in model container [2025-03-04 01:56:36,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:56:35" (2/3) ... [2025-03-04 01:56:36,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a4fcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:56:36, skipping insertion in model container [2025-03-04 01:56:36,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:56:36" (3/3) ... [2025-03-04 01:56:36,086 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-88.i [2025-03-04 01:56:36,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:56:36,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-88.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:56:36,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:56:36,159 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;@a619297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:56:36,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:56:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:56:36,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:36,176 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:36,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:36,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1534683364, now seen corresponding path program 1 times [2025-03-04 01:56:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675754767] [2025-03-04 01:56:36,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:36,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:56:36,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:56:36,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:36,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:56:36,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:36,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675754767] [2025-03-04 01:56:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675754767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:56:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032511692] [2025-03-04 01:56:36,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:36,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:56:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:56:36,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:56:36,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:56:36,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:56:36,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:56:36,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:36,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:36,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:56:36,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:56:36,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032511692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:36,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:56:36,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:56:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766807869] [2025-03-04 01:56:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:36,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:56:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:36,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:56:36,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:56:36,873 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:36,922 INFO L93 Difference]: Finished difference Result 230 states and 358 transitions. [2025-03-04 01:56:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:56:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-03-04 01:56:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:36,934 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:56:36,935 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:56:36,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-04 01:56:36,942 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:36,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:56:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:56:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 01:56:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-03-04 01:56:36,979 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2025-03-04 01:56:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-03-04 01:56:36,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-03-04 01:56:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:56:36,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:36,985 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:36,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:56:37,189 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-04 01:56:37,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:37,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash -186126055, now seen corresponding path program 1 times [2025-03-04 01:56:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:37,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262370528] [2025-03-04 01:56:37,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:37,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:56:37,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:56:37,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:37,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262370528] [2025-03-04 01:56:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262370528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:37,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:56:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018906767] [2025-03-04 01:56:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:37,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:56:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:37,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:56:37,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:37,601 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:37,650 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-04 01:56:37,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:56:37,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-04 01:56:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:37,654 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:56:37,654 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:56:37,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:37,656 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:37,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:56:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:56:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:56:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-04 01:56:37,673 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2025-03-04 01:56:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:37,674 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-04 01:56:37,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-04 01:56:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:56:37,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:37,676 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:56:37,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:37,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1993580518, now seen corresponding path program 1 times [2025-03-04 01:56:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:37,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325677834] [2025-03-04 01:56:37,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:37,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:56:37,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:56:37,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:37,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:37,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325677834] [2025-03-04 01:56:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325677834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:37,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:56:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728877897] [2025-03-04 01:56:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:37,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:56:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:37,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:56:37,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:37,911 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:37,940 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2025-03-04 01:56:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:56:37,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-04 01:56:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:37,942 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:56:37,944 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:56:37,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:37,945 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:37,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:56:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:56:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 01:56:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-04 01:56:37,959 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2025-03-04 01:56:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:37,960 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-04 01:56:37,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-04 01:56:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:56:37,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:37,965 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:37,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:56:37,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:37,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1106076837, now seen corresponding path program 1 times [2025-03-04 01:56:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:37,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730928524] [2025-03-04 01:56:37,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:37,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:38,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:56:38,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:56:38,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:38,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:38,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730928524] [2025-03-04 01:56:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730928524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:38,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:56:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075804284] [2025-03-04 01:56:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:38,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:56:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:38,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:56:38,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:38,189 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:38,218 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2025-03-04 01:56:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:56:38,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-04 01:56:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:38,219 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:56:38,219 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:56:38,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:38,220 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:38,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:56:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:56:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:56:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2025-03-04 01:56:38,232 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2025-03-04 01:56:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:38,233 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2025-03-04 01:56:38,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2025-03-04 01:56:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:56:38,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:38,235 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:38,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:56:38,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1105153316, now seen corresponding path program 1 times [2025-03-04 01:56:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016390249] [2025-03-04 01:56:38,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:38,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:56:38,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:56:38,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:38,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:40,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016390249] [2025-03-04 01:56:40,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016390249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:40,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:56:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608716075] [2025-03-04 01:56:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:40,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:56:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:40,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:56:40,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:56:40,071 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:40,754 INFO L93 Difference]: Finished difference Result 303 states and 436 transitions. [2025-03-04 01:56:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:56:40,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-04 01:56:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:40,757 INFO L225 Difference]: With dead ends: 303 [2025-03-04 01:56:40,757 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 01:56:40,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:56:40,759 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 274 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:40,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 548 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:56:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 01:56:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 139. [2025-03-04 01:56:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2025-03-04 01:56:40,786 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 143 [2025-03-04 01:56:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:40,786 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2025-03-04 01:56:40,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2025-03-04 01:56:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:56:40,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:40,788 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:40,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:56:40,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:40,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 845832442, now seen corresponding path program 1 times [2025-03-04 01:56:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:40,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712663500] [2025-03-04 01:56:40,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:40,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:40,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:56:40,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:56:40,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:40,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712663500] [2025-03-04 01:56:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712663500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:42,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:42,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:56:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443156661] [2025-03-04 01:56:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:42,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:56:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:42,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:56:42,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:56:42,417 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:42,905 INFO L93 Difference]: Finished difference Result 335 states and 484 transitions. [2025-03-04 01:56:42,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:56:42,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-04 01:56:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:42,907 INFO L225 Difference]: With dead ends: 335 [2025-03-04 01:56:42,907 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 01:56:42,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:56:42,908 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 310 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:42,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 469 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:56:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 01:56:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 137. [2025-03-04 01:56:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 118 states have internal predecessors, (164), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 198 transitions. [2025-03-04 01:56:42,920 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 198 transitions. Word has length 145 [2025-03-04 01:56:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:42,920 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 198 transitions. [2025-03-04 01:56:42,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2025-03-04 01:56:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:56:42,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:42,921 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:56:42,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1241611270, now seen corresponding path program 1 times [2025-03-04 01:56:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:42,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354731558] [2025-03-04 01:56:42,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:42,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:56:43,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:56:43,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:43,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:44,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354731558] [2025-03-04 01:56:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354731558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:56:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066258542] [2025-03-04 01:56:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:44,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:56:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:44,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:56:44,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:56:44,783 INFO L87 Difference]: Start difference. First operand 137 states and 198 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:45,648 INFO L93 Difference]: Finished difference Result 351 states and 508 transitions. [2025-03-04 01:56:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:56:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-03-04 01:56:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:45,651 INFO L225 Difference]: With dead ends: 351 [2025-03-04 01:56:45,651 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 01:56:45,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:56:45,652 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 367 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:45,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 446 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:56:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 01:56:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 141. [2025-03-04 01:56:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 122 states have internal predecessors, (170), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-04 01:56:45,668 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 145 [2025-03-04 01:56:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:45,668 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-04 01:56:45,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-04 01:56:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:56:45,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:45,669 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:45,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:56:45,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:45,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607274, now seen corresponding path program 1 times [2025-03-04 01:56:45,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491496350] [2025-03-04 01:56:45,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:45,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:56:45,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:56:45,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:56:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491496350] [2025-03-04 01:56:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491496350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:56:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599260009] [2025-03-04 01:56:45,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:56:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:56:45,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:56:45,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:56:46,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:56:46,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:56:46,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:46,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:46,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:56:46,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:46,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599260009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:46,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:56:46,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:56:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670590730] [2025-03-04 01:56:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:46,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:56:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:46,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:56:46,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:56:46,174 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:46,219 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-03-04 01:56:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:56:46,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-04 01:56:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:46,222 INFO L225 Difference]: With dead ends: 282 [2025-03-04 01:56:46,222 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 01:56:46,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:56:46,223 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:46,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:56:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 01:56:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 01:56:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.384) internal successors, (173), 125 states have internal predecessors, (173), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 207 transitions. [2025-03-04 01:56:46,237 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 207 transitions. Word has length 145 [2025-03-04 01:56:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:46,237 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 207 transitions. [2025-03-04 01:56:46,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 207 transitions. [2025-03-04 01:56:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:56:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:46,239 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:46,247 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-04 01:56:46,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 01:56:46,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2109488439, now seen corresponding path program 1 times [2025-03-04 01:56:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:46,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179316276] [2025-03-04 01:56:46,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:46,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:56:46,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:56:46,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:46,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179316276] [2025-03-04 01:56:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179316276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:56:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332169168] [2025-03-04 01:56:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:56:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:47,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:56:47,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:56:47,699 INFO L87 Difference]: Start difference. First operand 144 states and 207 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:48,337 INFO L93 Difference]: Finished difference Result 348 states and 498 transitions. [2025-03-04 01:56:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:56:48,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-03-04 01:56:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:48,340 INFO L225 Difference]: With dead ends: 348 [2025-03-04 01:56:48,340 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 01:56:48,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:56:48,341 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 330 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:48,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 503 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:56:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 01:56:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 161. [2025-03-04 01:56:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2025-03-04 01:56:48,352 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 146 [2025-03-04 01:56:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:48,353 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2025-03-04 01:56:48,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2025-03-04 01:56:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:56:48,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:48,354 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:48,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:56:48,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:48,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1049961112, now seen corresponding path program 1 times [2025-03-04 01:56:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:48,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226330448] [2025-03-04 01:56:48,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:48,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:56:48,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:56:48,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:49,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226330448] [2025-03-04 01:56:49,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226330448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:49,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:49,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:56:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780661373] [2025-03-04 01:56:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:49,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:56:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:49,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:56:49,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:56:49,993 INFO L87 Difference]: Start difference. First operand 161 states and 234 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:50,709 INFO L93 Difference]: Finished difference Result 325 states and 472 transitions. [2025-03-04 01:56:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:56:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2025-03-04 01:56:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:50,715 INFO L225 Difference]: With dead ends: 325 [2025-03-04 01:56:50,715 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 01:56:50,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:56:50,716 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 316 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:50,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 313 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:56:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 01:56:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2025-03-04 01:56:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 126 states have internal predecessors, (175), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:56:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2025-03-04 01:56:50,733 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 147 [2025-03-04 01:56:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:50,733 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2025-03-04 01:56:50,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:56:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2025-03-04 01:56:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:56:50,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:50,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:50,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:56:50,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1100012089, now seen corresponding path program 1 times [2025-03-04 01:56:50,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715673792] [2025-03-04 01:56:50,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:50,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:56:50,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:56:50,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:50,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715673792] [2025-03-04 01:56:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715673792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:51,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:56:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059039531] [2025-03-04 01:56:51,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:51,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:56:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:51,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:56:51,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:51,348 INFO L87 Difference]: Start difference. First operand 145 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:51,657 INFO L93 Difference]: Finished difference Result 430 states and 622 transitions. [2025-03-04 01:56:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:56:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-04 01:56:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:51,659 INFO L225 Difference]: With dead ends: 430 [2025-03-04 01:56:51,659 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 01:56:51,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:56:51,661 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 140 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:51,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 375 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:56:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 01:56:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 227. [2025-03-04 01:56:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 1.368421052631579) internal successors, (260), 190 states have internal predecessors, (260), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:56:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-03-04 01:56:51,704 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 147 [2025-03-04 01:56:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:51,704 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-03-04 01:56:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-03-04 01:56:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:56:51,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:51,708 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:56:51,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:51,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -633053946, now seen corresponding path program 1 times [2025-03-04 01:56:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038550969] [2025-03-04 01:56:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:51,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:56:51,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:56:51,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:51,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038550969] [2025-03-04 01:56:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038550969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:52,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:56:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606955028] [2025-03-04 01:56:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:56:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:52,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:56:52,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:52,092 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:52,374 INFO L93 Difference]: Finished difference Result 463 states and 669 transitions. [2025-03-04 01:56:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:56:52,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-04 01:56:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:52,376 INFO L225 Difference]: With dead ends: 463 [2025-03-04 01:56:52,376 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 01:56:52,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:56:52,377 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 136 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:52,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 378 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:56:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 01:56:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 229. [2025-03-04 01:56:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.359375) internal successors, (261), 192 states have internal predecessors, (261), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:56:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 329 transitions. [2025-03-04 01:56:52,413 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 329 transitions. Word has length 149 [2025-03-04 01:56:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:52,414 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 329 transitions. [2025-03-04 01:56:52,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 329 transitions. [2025-03-04 01:56:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:56:52,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:52,416 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:52,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:56:52,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash -240134859, now seen corresponding path program 1 times [2025-03-04 01:56:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304521046] [2025-03-04 01:56:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:52,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:56:52,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:56:52,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:52,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304521046] [2025-03-04 01:56:52,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304521046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:52,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:52,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:56:52,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045928239] [2025-03-04 01:56:52,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:52,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:56:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:52,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:56:52,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:56:52,778 INFO L87 Difference]: Start difference. First operand 229 states and 329 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:52,961 INFO L93 Difference]: Finished difference Result 412 states and 589 transitions. [2025-03-04 01:56:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:56:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-04 01:56:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:52,966 INFO L225 Difference]: With dead ends: 412 [2025-03-04 01:56:52,966 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 01:56:52,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:56:52,967 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 86 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:52,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 421 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:56:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 01:56:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 234. [2025-03-04 01:56:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:56:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 336 transitions. [2025-03-04 01:56:53,000 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 336 transitions. Word has length 151 [2025-03-04 01:56:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:53,000 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 336 transitions. [2025-03-04 01:56:53,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 336 transitions. [2025-03-04 01:56:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:56:53,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:53,001 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:53,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:56:53,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:53,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2016776148, now seen corresponding path program 1 times [2025-03-04 01:56:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:53,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151364339] [2025-03-04 01:56:53,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:53,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:53,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:56:53,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:56:53,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:53,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151364339] [2025-03-04 01:56:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151364339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:53,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:53,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:56:53,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234640713] [2025-03-04 01:56:53,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:53,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:56:53,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:53,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:56:53,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:56:53,508 INFO L87 Difference]: Start difference. First operand 234 states and 336 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:53,819 INFO L93 Difference]: Finished difference Result 443 states and 633 transitions. [2025-03-04 01:56:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:56:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-04 01:56:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:53,822 INFO L225 Difference]: With dead ends: 443 [2025-03-04 01:56:53,822 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 01:56:53,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:56:53,822 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 120 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:53,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 637 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:56:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 01:56:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 240. [2025-03-04 01:56:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:56:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 342 transitions. [2025-03-04 01:56:53,852 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 342 transitions. Word has length 151 [2025-03-04 01:56:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:53,853 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 342 transitions. [2025-03-04 01:56:53,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 342 transitions. [2025-03-04 01:56:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:56:53,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:53,855 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:53,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:56:53,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:53,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1883712145, now seen corresponding path program 1 times [2025-03-04 01:56:53,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:53,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370066204] [2025-03-04 01:56:53,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:53,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:53,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:56:53,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:56:53,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:53,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:55,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:55,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370066204] [2025-03-04 01:56:55,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370066204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:55,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:55,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:56:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218890598] [2025-03-04 01:56:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:56:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:55,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:56:55,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:56:55,021 INFO L87 Difference]: Start difference. First operand 240 states and 342 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:55,559 INFO L93 Difference]: Finished difference Result 467 states and 664 transitions. [2025-03-04 01:56:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:56:55,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2025-03-04 01:56:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:55,561 INFO L225 Difference]: With dead ends: 467 [2025-03-04 01:56:55,561 INFO L226 Difference]: Without dead ends: 320 [2025-03-04 01:56:55,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:56:55,563 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 311 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:55,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 573 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:56:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-04 01:56:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 236. [2025-03-04 01:56:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 199 states have (on average 1.3467336683417086) internal successors, (268), 199 states have internal predecessors, (268), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:56:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 336 transitions. [2025-03-04 01:56:55,590 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 336 transitions. Word has length 152 [2025-03-04 01:56:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 336 transitions. [2025-03-04 01:56:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2025-03-04 01:56:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:56:55,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:55,593 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:55,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:56:55,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:55,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -498953617, now seen corresponding path program 1 times [2025-03-04 01:56:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779151112] [2025-03-04 01:56:55,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:55,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:56:55,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:56:55,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:55,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:56,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:56,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779151112] [2025-03-04 01:56:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779151112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:56,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:56,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:56:56,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843453573] [2025-03-04 01:56:56,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:56,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:56:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:56,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:56:56,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:56:56,804 INFO L87 Difference]: Start difference. First operand 236 states and 336 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:57,735 INFO L93 Difference]: Finished difference Result 500 states and 713 transitions. [2025-03-04 01:56:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:56:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2025-03-04 01:56:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:57,738 INFO L225 Difference]: With dead ends: 500 [2025-03-04 01:56:57,738 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 01:56:57,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:56:57,739 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 268 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:57,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 632 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:56:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 01:56:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 244. [2025-03-04 01:56:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 207 states have internal predecessors, (280), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:56:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 348 transitions. [2025-03-04 01:56:57,769 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 348 transitions. Word has length 152 [2025-03-04 01:56:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:57,770 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 348 transitions. [2025-03-04 01:56:57,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:56:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 348 transitions. [2025-03-04 01:56:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:56:57,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:57,772 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:57,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:56:57,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:57,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash -784329245, now seen corresponding path program 1 times [2025-03-04 01:56:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:56:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163257048] [2025-03-04 01:56:57,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:56:57,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:56:57,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:56:57,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:57,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:56:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:56:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163257048] [2025-03-04 01:56:59,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163257048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:59,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:59,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:56:59,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47536987] [2025-03-04 01:56:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:59,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:56:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:56:59,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:56:59,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:56:59,458 INFO L87 Difference]: Start difference. First operand 244 states and 348 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:57:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:00,253 INFO L93 Difference]: Finished difference Result 479 states and 679 transitions. [2025-03-04 01:57:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:57:00,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 152 [2025-03-04 01:57:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:00,259 INFO L225 Difference]: With dead ends: 479 [2025-03-04 01:57:00,259 INFO L226 Difference]: Without dead ends: 330 [2025-03-04 01:57:00,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:57:00,260 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 424 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:00,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 530 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:57:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-04 01:57:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 301. [2025-03-04 01:57:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 264 states have (on average 1.356060606060606) internal successors, (358), 264 states have internal predecessors, (358), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 426 transitions. [2025-03-04 01:57:00,292 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 426 transitions. Word has length 152 [2025-03-04 01:57:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:00,293 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 426 transitions. [2025-03-04 01:57:00,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:57:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 426 transitions. [2025-03-04 01:57:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:57:00,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:00,294 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:00,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:57:00,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:00,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:00,295 INFO L85 PathProgramCache]: Analyzing trace with hash 318582545, now seen corresponding path program 1 times [2025-03-04 01:57:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:00,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457012718] [2025-03-04 01:57:00,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:00,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:57:00,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:57:00,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:00,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457012718] [2025-03-04 01:57:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457012718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:01,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:57:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373067847] [2025-03-04 01:57:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:01,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:57:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:01,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:57:01,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:57:01,836 INFO L87 Difference]: Start difference. First operand 301 states and 426 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:02,241 INFO L93 Difference]: Finished difference Result 495 states and 708 transitions. [2025-03-04 01:57:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:57:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-04 01:57:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:02,243 INFO L225 Difference]: With dead ends: 495 [2025-03-04 01:57:02,243 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 01:57:02,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:57:02,244 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 246 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:02,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 467 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:57:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 01:57:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 241. [2025-03-04 01:57:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 204 states have (on average 1.3235294117647058) internal successors, (270), 204 states have internal predecessors, (270), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 338 transitions. [2025-03-04 01:57:02,265 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 338 transitions. Word has length 154 [2025-03-04 01:57:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:02,266 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 338 transitions. [2025-03-04 01:57:02,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 338 transitions. [2025-03-04 01:57:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:57:02,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:02,267 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:02,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:57:02,267 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash -854158559, now seen corresponding path program 1 times [2025-03-04 01:57:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:02,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792163006] [2025-03-04 01:57:02,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:57:02,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:57:02,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:02,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:02,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792163006] [2025-03-04 01:57:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792163006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:02,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:02,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:57:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789323013] [2025-03-04 01:57:02,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:02,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:57:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:02,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:57:02,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:57:02,326 INFO L87 Difference]: Start difference. First operand 241 states and 338 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:02,353 INFO L93 Difference]: Finished difference Result 408 states and 574 transitions. [2025-03-04 01:57:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:57:02,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-04 01:57:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:02,355 INFO L225 Difference]: With dead ends: 408 [2025-03-04 01:57:02,355 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 01:57:02,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:57:02,356 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:02,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:57:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 01:57:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-04 01:57:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 206 states have (on average 1.3203883495145632) internal successors, (272), 206 states have internal predecessors, (272), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 340 transitions. [2025-03-04 01:57:02,377 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 340 transitions. Word has length 154 [2025-03-04 01:57:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:02,377 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 340 transitions. [2025-03-04 01:57:02,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 340 transitions. [2025-03-04 01:57:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:57:02,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:02,378 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:02,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:57:02,379 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:02,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2116452566, now seen corresponding path program 1 times [2025-03-04 01:57:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501356204] [2025-03-04 01:57:02,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:02,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:57:02,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:57:02,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:02,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501356204] [2025-03-04 01:57:02,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501356204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:02,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:02,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:57:02,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110113601] [2025-03-04 01:57:02,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:02,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:57:02,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:02,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:57:02,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:57:02,958 INFO L87 Difference]: Start difference. First operand 243 states and 340 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:03,336 INFO L93 Difference]: Finished difference Result 521 states and 725 transitions. [2025-03-04 01:57:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:57:03,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-04 01:57:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:03,337 INFO L225 Difference]: With dead ends: 521 [2025-03-04 01:57:03,337 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 01:57:03,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:57:03,338 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 385 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:03,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 361 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:57:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 01:57:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2025-03-04 01:57:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 252 states have (on average 1.3174603174603174) internal successors, (332), 252 states have internal predecessors, (332), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 400 transitions. [2025-03-04 01:57:03,362 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 400 transitions. Word has length 154 [2025-03-04 01:57:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:03,362 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 400 transitions. [2025-03-04 01:57:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 400 transitions. [2025-03-04 01:57:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:57:03,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:03,363 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:03,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:57:03,363 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -349633723, now seen corresponding path program 1 times [2025-03-04 01:57:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206419899] [2025-03-04 01:57:03,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:03,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:57:03,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:57:03,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:03,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:03,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:03,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206419899] [2025-03-04 01:57:03,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206419899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:03,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:03,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:57:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193108687] [2025-03-04 01:57:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:03,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:57:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:03,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:57:03,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:57:03,422 INFO L87 Difference]: Start difference. First operand 289 states and 400 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:03,452 INFO L93 Difference]: Finished difference Result 473 states and 661 transitions. [2025-03-04 01:57:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:57:03,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-04 01:57:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:03,453 INFO L225 Difference]: With dead ends: 473 [2025-03-04 01:57:03,453 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 01:57:03,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:57:03,454 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:03,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:57:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 01:57:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-04 01:57:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 254 states have (on average 1.31496062992126) internal successors, (334), 254 states have internal predecessors, (334), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 402 transitions. [2025-03-04 01:57:03,477 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 402 transitions. Word has length 154 [2025-03-04 01:57:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:03,479 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 402 transitions. [2025-03-04 01:57:03,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2025-03-04 01:57:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:57:03,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:03,480 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:57:03,480 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1758408518, now seen corresponding path program 1 times [2025-03-04 01:57:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781117187] [2025-03-04 01:57:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:57:03,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:57:03,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:03,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781117187] [2025-03-04 01:57:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781117187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:03,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:03,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:57:03,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331736699] [2025-03-04 01:57:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:03,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:57:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:03,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:57:03,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:57:03,998 INFO L87 Difference]: Start difference. First operand 291 states and 402 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:04,262 INFO L93 Difference]: Finished difference Result 296 states and 407 transitions. [2025-03-04 01:57:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:57:04,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-04 01:57:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:04,264 INFO L225 Difference]: With dead ends: 296 [2025-03-04 01:57:04,264 INFO L226 Difference]: Without dead ends: 294 [2025-03-04 01:57:04,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:57:04,266 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 236 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:04,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 526 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:57:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-04 01:57:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-04 01:57:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 257 states have (on average 1.311284046692607) internal successors, (337), 257 states have internal predecessors, (337), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 405 transitions. [2025-03-04 01:57:04,290 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 405 transitions. Word has length 154 [2025-03-04 01:57:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:04,290 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 405 transitions. [2025-03-04 01:57:04,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 405 transitions. [2025-03-04 01:57:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:57:04,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:04,291 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:04,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:57:04,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:04,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1757484997, now seen corresponding path program 1 times [2025-03-04 01:57:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:04,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835331524] [2025-03-04 01:57:04,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:04,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:57:04,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:57:04,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:04,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:57:06,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835331524] [2025-03-04 01:57:06,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835331524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:57:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430503590] [2025-03-04 01:57:06,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:06,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:57:06,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:57:06,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:57:06,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:57:06,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:57:06,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:57:06,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:06,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:06,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 01:57:06,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:57:06,625 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 55 treesize of output 54 [2025-03-04 01:57:06,818 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 82 treesize of output 71 [2025-03-04 01:57:07,213 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 86 treesize of output 73 [2025-03-04 01:57:07,647 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 90 treesize of output 75 [2025-03-04 01:57:08,059 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 94 treesize of output 77 [2025-03-04 01:57:08,429 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 98 treesize of output 79 [2025-03-04 01:57:08,792 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 102 treesize of output 81 [2025-03-04 01:57:09,426 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 115 treesize of output 90 [2025-03-04 01:57:10,019 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 121 treesize of output 94 [2025-03-04 01:57:10,442 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 121 treesize of output 94 [2025-03-04 01:57:11,035 INFO L349 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2025-03-04 01:57:11,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 109 [2025-03-04 01:57:11,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:57:11,641 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 462 treesize of output 382 [2025-03-04 01:57:11,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2025-03-04 01:57:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 504 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 01:57:12,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:57:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430503590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:57:12,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:57:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 27 [2025-03-04 01:57:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615964732] [2025-03-04 01:57:12,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:57:12,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 01:57:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:12,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 01:57:12,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:57:12,713 INFO L87 Difference]: Start difference. First operand 294 states and 405 transitions. Second operand has 27 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 15 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (34), 13 states have call predecessors, (34), 15 states have call successors, (34) [2025-03-04 01:57:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:17,837 INFO L93 Difference]: Finished difference Result 515 states and 696 transitions. [2025-03-04 01:57:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 01:57:17,837 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 15 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (34), 13 states have call predecessors, (34), 15 states have call successors, (34) Word has length 154 [2025-03-04 01:57:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:17,840 INFO L225 Difference]: With dead ends: 515 [2025-03-04 01:57:17,840 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 01:57:17,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 01:57:17,842 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 137 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:17,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 753 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 01:57:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 01:57:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2025-03-04 01:57:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 255 states have (on average 1.2941176470588236) internal successors, (330), 255 states have internal predecessors, (330), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2025-03-04 01:57:17,911 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 154 [2025-03-04 01:57:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:17,915 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2025-03-04 01:57:17,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 15 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (34), 13 states have call predecessors, (34), 15 states have call successors, (34) [2025-03-04 01:57:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2025-03-04 01:57:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:57:17,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:17,923 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:17,933 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-04 01:57:18,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:57:18,124 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1851751244, now seen corresponding path program 1 times [2025-03-04 01:57:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944417903] [2025-03-04 01:57:18,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:18,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:57:18,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:57:18,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:18,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:22,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:22,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944417903] [2025-03-04 01:57:22,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944417903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:22,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:22,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:57:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982287763] [2025-03-04 01:57:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:22,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:57:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:22,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:57:22,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:57:22,535 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:23,347 INFO L93 Difference]: Finished difference Result 618 states and 836 transitions. [2025-03-04 01:57:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:57:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-04 01:57:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:23,351 INFO L225 Difference]: With dead ends: 618 [2025-03-04 01:57:23,351 INFO L226 Difference]: Without dead ends: 431 [2025-03-04 01:57:23,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:57:23,353 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 333 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:23,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 369 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:57:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-04 01:57:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 362. [2025-03-04 01:57:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 319 states have (on average 1.3103448275862069) internal successors, (418), 319 states have internal predecessors, (418), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 486 transitions. [2025-03-04 01:57:23,408 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 486 transitions. Word has length 156 [2025-03-04 01:57:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:23,410 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 486 transitions. [2025-03-04 01:57:23,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 486 transitions. [2025-03-04 01:57:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:57:23,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:23,413 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:23,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:57:23,413 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:23,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash 498441547, now seen corresponding path program 1 times [2025-03-04 01:57:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894609879] [2025-03-04 01:57:23,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:23,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:57:23,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:57:23,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:23,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:24,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894609879] [2025-03-04 01:57:24,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894609879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:24,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:24,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:57:24,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298704928] [2025-03-04 01:57:24,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:24,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:57:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:24,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:57:24,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:57:24,478 INFO L87 Difference]: Start difference. First operand 362 states and 486 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:24,950 INFO L93 Difference]: Finished difference Result 654 states and 891 transitions. [2025-03-04 01:57:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:57:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-04 01:57:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:24,955 INFO L225 Difference]: With dead ends: 654 [2025-03-04 01:57:24,956 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 01:57:24,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:57:24,957 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 158 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:24,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 410 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:57:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 01:57:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2025-03-04 01:57:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 325 states have (on average 1.3107692307692307) internal successors, (426), 325 states have internal predecessors, (426), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 494 transitions. [2025-03-04 01:57:25,005 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 494 transitions. Word has length 156 [2025-03-04 01:57:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:25,005 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 494 transitions. [2025-03-04 01:57:25,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 494 transitions. [2025-03-04 01:57:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:57:25,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:25,007 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:25,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:57:25,008 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:25,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1144866740, now seen corresponding path program 1 times [2025-03-04 01:57:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:25,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756983028] [2025-03-04 01:57:25,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:25,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:57:25,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:57:25,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756983028] [2025-03-04 01:57:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756983028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:57:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415653715] [2025-03-04 01:57:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:57:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:27,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:57:27,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:57:27,805 INFO L87 Difference]: Start difference. First operand 368 states and 494 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:28,726 INFO L93 Difference]: Finished difference Result 746 states and 1015 transitions. [2025-03-04 01:57:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:57:28,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-04 01:57:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:28,731 INFO L225 Difference]: With dead ends: 746 [2025-03-04 01:57:28,733 INFO L226 Difference]: Without dead ends: 515 [2025-03-04 01:57:28,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:57:28,735 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 583 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:28,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 424 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:57:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-04 01:57:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 396. [2025-03-04 01:57:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 353 states have (on average 1.3059490084985836) internal successors, (461), 353 states have internal predecessors, (461), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:57:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 529 transitions. [2025-03-04 01:57:28,817 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 529 transitions. Word has length 156 [2025-03-04 01:57:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:28,817 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 529 transitions. [2025-03-04 01:57:28,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 529 transitions. [2025-03-04 01:57:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:57:28,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:28,819 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:28,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:57:28,820 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -785899171, now seen corresponding path program 1 times [2025-03-04 01:57:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260959424] [2025-03-04 01:57:28,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:28,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:57:28,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:57:28,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:28,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260959424] [2025-03-04 01:57:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260959424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:32,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:32,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:57:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157270544] [2025-03-04 01:57:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:32,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:57:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:32,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:57:32,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:57:32,735 INFO L87 Difference]: Start difference. First operand 396 states and 529 transitions. Second operand has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:57:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:34,188 INFO L93 Difference]: Finished difference Result 1039 states and 1413 transitions. [2025-03-04 01:57:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:57:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 156 [2025-03-04 01:57:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:34,191 INFO L225 Difference]: With dead ends: 1039 [2025-03-04 01:57:34,191 INFO L226 Difference]: Without dead ends: 804 [2025-03-04 01:57:34,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:57:34,196 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 568 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:34,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 829 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:57:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-04 01:57:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2025-03-04 01:57:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 724 states have (on average 1.3135359116022098) internal successors, (951), 725 states have internal predecessors, (951), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 01:57:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1073 transitions. [2025-03-04 01:57:34,284 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1073 transitions. Word has length 156 [2025-03-04 01:57:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:34,284 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1073 transitions. [2025-03-04 01:57:34,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:57:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1073 transitions. [2025-03-04 01:57:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:57:34,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:34,286 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:57:34,286 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash 939581726, now seen corresponding path program 1 times [2025-03-04 01:57:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116390539] [2025-03-04 01:57:34,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:34,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:34,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:57:34,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:57:34,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:34,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:35,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:35,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116390539] [2025-03-04 01:57:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116390539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:35,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:35,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:57:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302251752] [2025-03-04 01:57:35,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:57:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:35,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:57:35,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:57:35,228 INFO L87 Difference]: Start difference. First operand 796 states and 1073 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:35,719 INFO L93 Difference]: Finished difference Result 1367 states and 1872 transitions. [2025-03-04 01:57:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:57:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-04 01:57:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:35,725 INFO L225 Difference]: With dead ends: 1367 [2025-03-04 01:57:35,725 INFO L226 Difference]: Without dead ends: 754 [2025-03-04 01:57:35,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:57:35,727 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:35,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 676 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:57:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-04 01:57:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-04 01:57:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 682 states have (on average 1.3181818181818181) internal successors, (899), 683 states have internal predecessors, (899), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 01:57:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1021 transitions. [2025-03-04 01:57:35,805 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1021 transitions. Word has length 156 [2025-03-04 01:57:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:35,806 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1021 transitions. [2025-03-04 01:57:35,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:57:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1021 transitions. [2025-03-04 01:57:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:57:35,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:35,807 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:35,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:57:35,807 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1437218740, now seen corresponding path program 1 times [2025-03-04 01:57:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:35,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236547653] [2025-03-04 01:57:35,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:35,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:35,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:57:35,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:57:35,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:35,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:57:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:57:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236547653] [2025-03-04 01:57:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236547653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:57:36,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:57:36,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:57:36,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429577572] [2025-03-04 01:57:36,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:57:36,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:57:36,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:57:36,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:57:36,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:57:36,072 INFO L87 Difference]: Start difference. First operand 754 states and 1021 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:36,625 INFO L93 Difference]: Finished difference Result 1578 states and 2150 transitions. [2025-03-04 01:57:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:57:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-04 01:57:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:36,634 INFO L225 Difference]: With dead ends: 1578 [2025-03-04 01:57:36,634 INFO L226 Difference]: Without dead ends: 929 [2025-03-04 01:57:36,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:57:36,637 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 130 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:36,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 653 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:57:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-04 01:57:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 753. [2025-03-04 01:57:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 681 states have (on average 1.315712187958884) internal successors, (896), 682 states have internal predecessors, (896), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 01:57:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1018 transitions. [2025-03-04 01:57:36,766 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1018 transitions. Word has length 156 [2025-03-04 01:57:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:36,767 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1018 transitions. [2025-03-04 01:57:36,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:57:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1018 transitions. [2025-03-04 01:57:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:57:36,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:36,769 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:36,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:57:36,769 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:36,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1305511662, now seen corresponding path program 1 times [2025-03-04 01:57:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:57:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644744431] [2025-03-04 01:57:36,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:57:36,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:57:36,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:57:36,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat