./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:06:46,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:06:46,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:06:46,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:06:46,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:06:46,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:06:46,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:06:46,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:06:46,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:06:46,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:06:46,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:06:46,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:06:46,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:06:46,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:06:46,527 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:06:46,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:06:46,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:06:46,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:06:46,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:06:46,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:06:46,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:06:46,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:06:46,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:06:46,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:06:46,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:06:46,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:06:46,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:06:46,531 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2025-03-08 17:06:46,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:06:46,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:06:46,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:06:46,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:06:46,743 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:06:46,744 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-8.i [2025-03-08 17:06:47,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778019c4a/b1a5ffca5d24493a97f1cd6dd7e7f47f/FLAG1466d039f [2025-03-08 17:06:48,130 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:06:48,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2025-03-08 17:06:48,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778019c4a/b1a5ffca5d24493a97f1cd6dd7e7f47f/FLAG1466d039f [2025-03-08 17:06:48,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778019c4a/b1a5ffca5d24493a97f1cd6dd7e7f47f [2025-03-08 17:06:48,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:06:48,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:06:48,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:06:48,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:06:48,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:06:48,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339da571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48, skipping insertion in model container [2025-03-08 17:06:48,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:06:48,562 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-8.i[916,929] [2025-03-08 17:06:48,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:06:48,624 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:06:48,633 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-8.i[916,929] [2025-03-08 17:06:48,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:06:48,690 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:06:48,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48 WrapperNode [2025-03-08 17:06:48,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:06:48,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:06:48,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:06:48,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:06:48,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,739 INFO L138 Inliner]: procedures = 30, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2025-03-08 17:06:48,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:06:48,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:06:48,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:06:48,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:06:48,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,758 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:06:48,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:06:48,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:06:48,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:06:48,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:06:48,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (1/1) ... [2025-03-08 17:06:48,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:06:48,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:06:48,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:06:48,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:06:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:06:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:06:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:06:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:06:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:06:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:06:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:06:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:06:48,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:06:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:06:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:06:48,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:06:48,915 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:06:48,916 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:06:49,276 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~short86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite104#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite117#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-08 17:06:49,314 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-08 17:06:49,314 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:06:49,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:06:49,324 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:06:49,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:06:49 BoogieIcfgContainer [2025-03-08 17:06:49,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:06:49,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:06:49,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:06:49,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:06:49,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:06:48" (1/3) ... [2025-03-08 17:06:49,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783d2d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:06:49, skipping insertion in model container [2025-03-08 17:06:49,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:48" (2/3) ... [2025-03-08 17:06:49,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783d2d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:06:49, skipping insertion in model container [2025-03-08 17:06:49,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:06:49" (3/3) ... [2025-03-08 17:06:49,331 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2025-03-08 17:06:49,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:06:49,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-8.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:06:49,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:06:49,390 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;@4c55db14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:06:49,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:06:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 17:06:49,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:49,406 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:49,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:49,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 753069846, now seen corresponding path program 1 times [2025-03-08 17:06:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:49,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90231182] [2025-03-08 17:06:49,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:49,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:49,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:49,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:49,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 17:06:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90231182] [2025-03-08 17:06:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90231182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:06:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287755790] [2025-03-08 17:06:49,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:49,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:06:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:06:49,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:06:49,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:06:49,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:49,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:49,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:49,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:49,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:06:49,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:06:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 17:06:49,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:06:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287755790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:49,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:06:49,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:06:49,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620200591] [2025-03-08 17:06:49,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:49,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:06:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:49,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:06:49,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:06:49,998 INFO L87 Difference]: Start difference. First operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 17:06:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:50,016 INFO L93 Difference]: Finished difference Result 192 states and 295 transitions. [2025-03-08 17:06:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:06:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-08 17:06:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:50,022 INFO L225 Difference]: With dead ends: 192 [2025-03-08 17:06:50,023 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 17:06:50,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:06:50,029 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:50,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 17:06:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 17:06:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-08 17:06:50,053 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2025-03-08 17:06:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:50,053 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-08 17:06:50,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 17:06:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-08 17:06:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 17:06:50,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:50,055 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:50,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:06:50,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 17:06:50,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:50,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1056752180, now seen corresponding path program 1 times [2025-03-08 17:06:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:50,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259680003] [2025-03-08 17:06:50,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:50,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:50,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:50,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:50,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259680003] [2025-03-08 17:06:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259680003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:06:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971686308] [2025-03-08 17:06:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:06:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:50,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:06:50,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:50,551 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 17:06:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:50,588 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2025-03-08 17:06:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:06:50,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-08 17:06:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:50,590 INFO L225 Difference]: With dead ends: 191 [2025-03-08 17:06:50,590 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 17:06:50,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:50,591 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:50,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 17:06:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 17:06:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-08 17:06:50,608 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2025-03-08 17:06:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:50,608 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-08 17:06:50,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 17:06:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-08 17:06:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 17:06:50,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:50,611 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:50,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:06:50,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 109944139, now seen corresponding path program 1 times [2025-03-08 17:06:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726246985] [2025-03-08 17:06:50,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:50,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:50,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:50,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:50,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726246985] [2025-03-08 17:06:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726246985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:50,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:06:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101105898] [2025-03-08 17:06:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:50,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:06:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:50,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:06:50,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:50,772 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:50,802 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-03-08 17:06:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:06:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-08 17:06:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:50,803 INFO L225 Difference]: With dead ends: 196 [2025-03-08 17:06:50,803 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 17:06:50,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:50,804 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:50,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 17:06:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-08 17:06:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-03-08 17:06:50,813 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2025-03-08 17:06:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:50,814 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-03-08 17:06:50,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-03-08 17:06:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 17:06:50,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:50,816 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:50,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:06:50,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1697510324, now seen corresponding path program 1 times [2025-03-08 17:06:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:50,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685703509] [2025-03-08 17:06:50,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:50,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:50,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:50,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:50,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:50,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685703509] [2025-03-08 17:06:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685703509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:50,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:06:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748021153] [2025-03-08 17:06:50,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:50,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:06:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:50,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:06:50,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:50,968 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:50,997 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2025-03-08 17:06:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:06:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-08 17:06:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:50,999 INFO L225 Difference]: With dead ends: 200 [2025-03-08 17:06:51,000 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 17:06:51,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:51,001 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:51,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 17:06:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-08 17:06:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-03-08 17:06:51,011 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2025-03-08 17:06:51,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:51,013 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-03-08 17:06:51,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-03-08 17:06:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 17:06:51,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:51,014 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:51,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:06:51,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:51,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:51,015 INFO L85 PathProgramCache]: Analyzing trace with hash -810006643, now seen corresponding path program 1 times [2025-03-08 17:06:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:51,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828469875] [2025-03-08 17:06:51,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:51,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:51,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:51,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:51,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:51,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828469875] [2025-03-08 17:06:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828469875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:06:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943831361] [2025-03-08 17:06:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:06:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:51,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:06:51,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:51,166 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:51,190 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2025-03-08 17:06:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:06:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-08 17:06:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:51,192 INFO L225 Difference]: With dead ends: 204 [2025-03-08 17:06:51,192 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 17:06:51,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:51,194 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:51,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:06:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 17:06:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-08 17:06:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-03-08 17:06:51,201 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 123 [2025-03-08 17:06:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:51,201 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-03-08 17:06:51,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-03-08 17:06:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 17:06:51,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:51,202 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:51,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:06:51,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -809083122, now seen corresponding path program 1 times [2025-03-08 17:06:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:51,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855192284] [2025-03-08 17:06:51,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:51,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:51,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:51,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:51,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:51,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855192284] [2025-03-08 17:06:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855192284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:06:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903460120] [2025-03-08 17:06:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:51,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:06:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:51,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:06:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:06:51,719 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:51,874 INFO L93 Difference]: Finished difference Result 207 states and 291 transitions. [2025-03-08 17:06:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:06:51,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-08 17:06:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:51,875 INFO L225 Difference]: With dead ends: 207 [2025-03-08 17:06:51,875 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 17:06:51,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:06:51,876 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 95 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:51,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 306 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:06:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 17:06:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-03-08 17:06:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2025-03-08 17:06:51,883 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 123 [2025-03-08 17:06:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:51,883 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2025-03-08 17:06:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:06:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2025-03-08 17:06:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 17:06:51,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:51,884 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:51,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:06:51,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1653554993, now seen corresponding path program 1 times [2025-03-08 17:06:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089613960] [2025-03-08 17:06:51,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:51,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 17:06:51,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 17:06:51,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:51,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:54,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:54,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089613960] [2025-03-08 17:06:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089613960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:54,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:54,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:06:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427460883] [2025-03-08 17:06:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:54,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:06:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:54,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:06:54,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:06:54,651 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 17:06:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:55,183 INFO L93 Difference]: Finished difference Result 243 states and 337 transitions. [2025-03-08 17:06:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:06:55,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-03-08 17:06:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:55,184 INFO L225 Difference]: With dead ends: 243 [2025-03-08 17:06:55,184 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 17:06:55,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:06:55,185 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 246 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:55,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 402 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:06:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 17:06:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2025-03-08 17:06:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2025-03-08 17:06:55,197 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 123 [2025-03-08 17:06:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:55,198 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2025-03-08 17:06:55,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 17:06:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2025-03-08 17:06:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 17:06:55,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:55,199 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:55,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:06:55,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:55,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash -24869591, now seen corresponding path program 1 times [2025-03-08 17:06:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:55,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393765605] [2025-03-08 17:06:55,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:55,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 17:06:55,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 17:06:55,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:55,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:57,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:57,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393765605] [2025-03-08 17:06:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393765605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:06:57,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115684326] [2025-03-08 17:06:57,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:57,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:06:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:57,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:06:57,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:06:57,167 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:06:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:58,534 INFO L93 Difference]: Finished difference Result 247 states and 341 transitions. [2025-03-08 17:06:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:06:58,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-03-08 17:06:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:58,537 INFO L225 Difference]: With dead ends: 247 [2025-03-08 17:06:58,539 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 17:06:58,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:06:58,541 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 282 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:58,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 510 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:06:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 17:06:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2025-03-08 17:06:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:06:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 149 transitions. [2025-03-08 17:06:58,563 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 149 transitions. Word has length 125 [2025-03-08 17:06:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:58,564 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 149 transitions. [2025-03-08 17:06:58,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:06:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2025-03-08 17:06:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 17:06:58,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:58,565 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:58,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:06:58,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:58,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash 621838025, now seen corresponding path program 1 times [2025-03-08 17:06:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168106670] [2025-03-08 17:06:58,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:06:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 17:06:58,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 17:06:58,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:06:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:06:59,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168106670] [2025-03-08 17:06:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168106670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:59,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:06:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166171351] [2025-03-08 17:06:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:59,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:06:59,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:06:59,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:06:59,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:06:59,933 INFO L87 Difference]: Start difference. First operand 108 states and 149 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:00,815 INFO L93 Difference]: Finished difference Result 243 states and 332 transitions. [2025-03-08 17:07:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:07:00,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-03-08 17:07:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:00,817 INFO L225 Difference]: With dead ends: 243 [2025-03-08 17:07:00,817 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 17:07:00,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:07:00,818 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 327 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:00,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 391 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:07:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 17:07:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 108. [2025-03-08 17:07:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:07:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2025-03-08 17:07:00,829 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 125 [2025-03-08 17:07:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:00,829 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2025-03-08 17:07:00,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2025-03-08 17:07:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 17:07:00,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:00,831 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:00,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:07:00,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -208773015, now seen corresponding path program 1 times [2025-03-08 17:07:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317931226] [2025-03-08 17:07:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:00,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 17:07:00,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 17:07:00,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:00,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:07:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317931226] [2025-03-08 17:07:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317931226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:01,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:01,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:07:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296873499] [2025-03-08 17:07:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:07:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:01,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:07:01,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:07:01,944 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:07:06,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-08 17:07:07,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-08 17:07:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:08,314 INFO L93 Difference]: Finished difference Result 249 states and 338 transitions. [2025-03-08 17:07:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:07:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-08 17:07:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:08,317 INFO L225 Difference]: With dead ends: 249 [2025-03-08 17:07:08,317 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 17:07:08,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-03-08 17:07:08,318 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 208 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:08,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 723 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-03-08 17:07:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 17:07:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2025-03-08 17:07:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:07:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2025-03-08 17:07:08,335 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 125 [2025-03-08 17:07:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:08,335 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2025-03-08 17:07:08,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:07:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2025-03-08 17:07:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 17:07:08,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:08,336 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:08,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:07:08,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:08,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1874553693, now seen corresponding path program 1 times [2025-03-08 17:07:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483113943] [2025-03-08 17:07:08,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:08,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 17:07:08,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 17:07:08,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:07:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483113943] [2025-03-08 17:07:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483113943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:07:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319954431] [2025-03-08 17:07:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:08,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:07:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:08,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:07:08,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:07:08,756 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:07:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:08,955 INFO L93 Difference]: Finished difference Result 262 states and 353 transitions. [2025-03-08 17:07:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:07:08,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-08 17:07:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:08,958 INFO L225 Difference]: With dead ends: 262 [2025-03-08 17:07:08,958 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 17:07:08,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:07:08,959 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 43 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:08,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 817 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:07:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 17:07:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2025-03-08 17:07:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 17:07:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2025-03-08 17:07:08,969 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 127 [2025-03-08 17:07:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:08,970 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2025-03-08 17:07:08,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:07:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2025-03-08 17:07:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 17:07:08,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:08,971 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:08,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:07:08,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:08,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash -582239253, now seen corresponding path program 1 times [2025-03-08 17:07:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77625571] [2025-03-08 17:07:08,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:08,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 17:07:09,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 17:07:09,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:09,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 17:07:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77625571] [2025-03-08 17:07:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77625571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 17:07:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363851015] [2025-03-08 17:07:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:11,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 17:07:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:11,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 17:07:11,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:07:11,609 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:17,013 INFO L93 Difference]: Finished difference Result 326 states and 440 transitions. [2025-03-08 17:07:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 17:07:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-03-08 17:07:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:17,015 INFO L225 Difference]: With dead ends: 326 [2025-03-08 17:07:17,015 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 17:07:17,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 17:07:17,016 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 604 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:17,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 746 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 17:07:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 17:07:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 168. [2025-03-08 17:07:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 139 states have (on average 1.2949640287769784) internal successors, (180), 140 states have internal predecessors, (180), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 17:07:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 232 transitions. [2025-03-08 17:07:17,038 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 232 transitions. Word has length 127 [2025-03-08 17:07:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:17,038 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 232 transitions. [2025-03-08 17:07:17,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 232 transitions. [2025-03-08 17:07:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 17:07:17,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:17,040 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:17,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:07:17,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:17,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 925312556, now seen corresponding path program 1 times [2025-03-08 17:07:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:17,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655203119] [2025-03-08 17:07:17,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:17,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 17:07:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 17:07:17,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:17,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:07:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655203119] [2025-03-08 17:07:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655203119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:07:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840816222] [2025-03-08 17:07:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:18,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:07:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:18,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:07:18,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:07:18,454 INFO L87 Difference]: Start difference. First operand 168 states and 232 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:19,311 INFO L93 Difference]: Finished difference Result 280 states and 385 transitions. [2025-03-08 17:07:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:07:19,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-03-08 17:07:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:19,314 INFO L225 Difference]: With dead ends: 280 [2025-03-08 17:07:19,314 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 17:07:19,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:07:19,314 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 344 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:19,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 386 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:07:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 17:07:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-08 17:07:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2919708029197081) internal successors, (177), 138 states have internal predecessors, (177), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 17:07:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 229 transitions. [2025-03-08 17:07:19,343 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 229 transitions. Word has length 127 [2025-03-08 17:07:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:19,344 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 229 transitions. [2025-03-08 17:07:19,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2025-03-08 17:07:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 17:07:19,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:19,345 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:19,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:07:19,345 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:19,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1078983748, now seen corresponding path program 1 times [2025-03-08 17:07:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413312928] [2025-03-08 17:07:19,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:19,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 17:07:19,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 17:07:19,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:19,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:07:20,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:20,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413312928] [2025-03-08 17:07:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413312928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:07:20,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815264069] [2025-03-08 17:07:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:20,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:07:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:20,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:07:20,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:07:20,033 INFO L87 Difference]: Start difference. First operand 166 states and 229 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:07:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:20,545 INFO L93 Difference]: Finished difference Result 278 states and 381 transitions. [2025-03-08 17:07:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:07:20,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-08 17:07:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:20,547 INFO L225 Difference]: With dead ends: 278 [2025-03-08 17:07:20,547 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 17:07:20,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:07:20,547 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 85 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:20,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 410 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:07:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 17:07:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-08 17:07:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 138 states have internal predecessors, (176), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 17:07:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2025-03-08 17:07:20,568 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 127 [2025-03-08 17:07:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:20,569 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2025-03-08 17:07:20,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 17:07:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2025-03-08 17:07:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 17:07:20,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:20,569 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:20,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:07:20,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:20,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1208066467, now seen corresponding path program 1 times [2025-03-08 17:07:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:20,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443350968] [2025-03-08 17:07:20,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:20,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:20,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 17:07:20,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 17:07:20,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:20,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 17:07:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443350968] [2025-03-08 17:07:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443350968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:22,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 17:07:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129555219] [2025-03-08 17:07:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:22,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:07:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:22,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:07:22,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:07:22,295 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:23,744 INFO L93 Difference]: Finished difference Result 171 states and 233 transitions. [2025-03-08 17:07:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:07:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-03-08 17:07:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:23,745 INFO L225 Difference]: With dead ends: 171 [2025-03-08 17:07:23,746 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 17:07:23,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2025-03-08 17:07:23,746 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 278 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:23,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 570 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:07:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 17:07:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 17:07:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 141 states have internal predecessors, (179), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 17:07:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 231 transitions. [2025-03-08 17:07:23,768 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 231 transitions. Word has length 127 [2025-03-08 17:07:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:23,769 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 231 transitions. [2025-03-08 17:07:23,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 17:07:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 231 transitions. [2025-03-08 17:07:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 17:07:23,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:23,770 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:23,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:07:23,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:23,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1208989988, now seen corresponding path program 1 times [2025-03-08 17:07:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:23,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652932365] [2025-03-08 17:07:23,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:23,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 17:07:23,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 17:07:23,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat