./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.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 a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:58:36,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:58:36,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:58:36,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:58:36,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:58:36,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:58:36,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:58:36,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:58:36,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:58:36,669 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:58:36,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:58:36,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:58:36,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:58:36,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:58:36,670 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:58:36,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:58:36,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:58:36,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:58:36,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:58:36,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:58:36,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:58:36,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:58:36,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:58:36,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:58:36,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:58:36,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:58:36,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:58:36,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:58:36,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:58:36,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:58:36,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:58:36,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:58:36,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:58:36,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:58:36,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:58:36,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:58:36,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:58:36,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:58:36,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:58:36,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:58:36,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:58:36,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:58:36,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:58:36,675 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 -> a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 [2025-03-17 05:58:36,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:58:36,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:58:36,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:58:36,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:58:36,972 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:58:36,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2025-03-17 05:58:38,213 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf173e4f/58b1c343fed1405294a42bccb8fc7460/FLAGbc016aa76 [2025-03-17 05:58:38,456 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:58:38,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2025-03-17 05:58:38,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf173e4f/58b1c343fed1405294a42bccb8fc7460/FLAGbc016aa76 [2025-03-17 05:58:38,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf173e4f/58b1c343fed1405294a42bccb8fc7460 [2025-03-17 05:58:38,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:58:38,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:58:38,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:58:38,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:58:38,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:58:38,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38, skipping insertion in model container [2025-03-17 05:58:38,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:58:38,617 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-s_file-53.i[916,929] [2025-03-17 05:58:38,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:58:38,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:58:38,684 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-s_file-53.i[916,929] [2025-03-17 05:58:38,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:58:38,733 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:58:38,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38 WrapperNode [2025-03-17 05:58:38,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:58:38,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:58:38,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:58:38,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:58:38,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,785 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2025-03-17 05:58:38,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:58:38,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:58:38,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:58:38,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:58:38,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,806 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:58:38,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:58:38,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:58:38,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:58:38,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:58:38,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (1/1) ... [2025-03-17 05:58:38,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:58:38,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:58:38,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:58:38,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:58:38,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:58:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:58:38,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:58:39,006 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:58:39,007 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:58:39,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite116#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite113#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem121#1;havoc property_#t~ite124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem135#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short134#1;havoc property_#t~short137#1; [2025-03-17 05:58:39,433 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-17 05:58:39,434 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:58:39,443 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:58:39,446 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:58:39,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:58:39 BoogieIcfgContainer [2025-03-17 05:58:39,446 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:58:39,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:58:39,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:58:39,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:58:39,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:58:38" (1/3) ... [2025-03-17 05:58:39,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31027395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:58:39, skipping insertion in model container [2025-03-17 05:58:39,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:38" (2/3) ... [2025-03-17 05:58:39,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31027395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:58:39, skipping insertion in model container [2025-03-17 05:58:39,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:58:39" (3/3) ... [2025-03-17 05:58:39,455 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-53.i [2025-03-17 05:58:39,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:58:39,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-53.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:58:39,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:58:39,536 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;@6449e3ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:58:39,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:58:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:58:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:58:39,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:39,555 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:39,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:39,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1010560767, now seen corresponding path program 1 times [2025-03-17 05:58:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:39,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111366790] [2025-03-17 05:58:39,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:39,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:58:39,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:58:39,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:39,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:58:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111366790] [2025-03-17 05:58:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111366790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:58:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037413419] [2025-03-17 05:58:39,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:39,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:58:39,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:58:39,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:58:39,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:58:40,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:58:40,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:58:40,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:40,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:40,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:58:40,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:58:40,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037413419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:40,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:58:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:58:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258957459] [2025-03-17 05:58:40,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:40,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:58:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:58:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:58:40,253 INFO L87 Difference]: Start difference. First operand has 106 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:58:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:40,271 INFO L93 Difference]: Finished difference Result 209 states and 330 transitions. [2025-03-17 05:58:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:58:40,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-17 05:58:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:40,277 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:58:40,278 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:58:40,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:58:40,282 INFO L435 NwaCegarLoop]: 151 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, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:40,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:58:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:58:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:58:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:58:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2025-03-17 05:58:40,312 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 136 [2025-03-17 05:58:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:40,313 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2025-03-17 05:58:40,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:58:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2025-03-17 05:58:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:58:40,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:40,316 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:40,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:58:40,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:58:40,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:40,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1739238449, now seen corresponding path program 1 times [2025-03-17 05:58:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577424757] [2025-03-17 05:58:40,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:40,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:40,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:58:40,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:58:40,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:40,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:41,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577424757] [2025-03-17 05:58:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577424757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:41,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:58:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692319408] [2025-03-17 05:58:41,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:41,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:58:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:41,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:58:41,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:58:41,207 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:58:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:41,235 INFO L93 Difference]: Finished difference Result 207 states and 301 transitions. [2025-03-17 05:58:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:58:41,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2025-03-17 05:58:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:41,239 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:58:41,240 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:58:41,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:58:41,241 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:41,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:58:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:58:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:58:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:58:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2025-03-17 05:58:41,258 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 136 [2025-03-17 05:58:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:41,259 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2025-03-17 05:58:41,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:58:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2025-03-17 05:58:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:58:41,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:41,263 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:41,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:58:41,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:41,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2045194670, now seen corresponding path program 1 times [2025-03-17 05:58:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:41,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686295211] [2025-03-17 05:58:41,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:41,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:41,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:58:41,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:58:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:41,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:43,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:43,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686295211] [2025-03-17 05:58:43,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686295211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:43,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:43,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:58:43,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463495636] [2025-03-17 05:58:43,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:43,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:43,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:43,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:43,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:43,086 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:58:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:43,400 INFO L93 Difference]: Finished difference Result 213 states and 305 transitions. [2025-03-17 05:58:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:58:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-17 05:58:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:43,402 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:58:43,402 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:58:43,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:58:43,403 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 82 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:43,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 387 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:58:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:58:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 05:58:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:58:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2025-03-17 05:58:43,415 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 136 [2025-03-17 05:58:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:43,415 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2025-03-17 05:58:43,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:58:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2025-03-17 05:58:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:58:43,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:43,417 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:43,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:58:43,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash 248243311, now seen corresponding path program 1 times [2025-03-17 05:58:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606769340] [2025-03-17 05:58:43,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:43,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:58:43,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:58:43,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:43,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606769340] [2025-03-17 05:58:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606769340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:58:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308185826] [2025-03-17 05:58:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:47,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:58:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:47,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:58:47,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:58:47,465 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:58:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:49,078 INFO L93 Difference]: Finished difference Result 365 states and 514 transitions. [2025-03-17 05:58:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:58:49,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 136 [2025-03-17 05:58:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:49,082 INFO L225 Difference]: With dead ends: 365 [2025-03-17 05:58:49,082 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 05:58:49,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:58:49,086 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 140 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:49,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 678 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 05:58:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 05:58:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 218. [2025-03-17 05:58:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 177 states have (on average 1.344632768361582) internal successors, (238), 177 states have internal predecessors, (238), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:58:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 310 transitions. [2025-03-17 05:58:49,141 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 310 transitions. Word has length 136 [2025-03-17 05:58:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:49,141 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 310 transitions. [2025-03-17 05:58:49,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:58:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 310 transitions. [2025-03-17 05:58:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:58:49,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:49,143 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:49,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:58:49,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash -257315314, now seen corresponding path program 1 times [2025-03-17 05:58:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539160611] [2025-03-17 05:58:49,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:58:49,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:58:49,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:49,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539160611] [2025-03-17 05:58:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539160611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:58:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736832460] [2025-03-17 05:58:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:52,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:58:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:52,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:58:52,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:58:52,192 INFO L87 Difference]: Start difference. First operand 218 states and 310 transitions. Second operand has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:58:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:52,896 INFO L93 Difference]: Finished difference Result 438 states and 620 transitions. [2025-03-17 05:58:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:58:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 136 [2025-03-17 05:58:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:52,899 INFO L225 Difference]: With dead ends: 438 [2025-03-17 05:58:52,900 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 05:58:52,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:58:52,901 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 90 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:52,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 539 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:58:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 05:58:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 213. [2025-03-17 05:58:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 172 states have internal predecessors, (230), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:58:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 302 transitions. [2025-03-17 05:58:52,926 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 302 transitions. Word has length 136 [2025-03-17 05:58:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:52,927 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 302 transitions. [2025-03-17 05:58:52,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:58:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 302 transitions. [2025-03-17 05:58:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:58:52,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:52,928 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:52,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:58:52,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:52,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -344615054, now seen corresponding path program 1 times [2025-03-17 05:58:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115419567] [2025-03-17 05:58:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:52,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:58:53,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:58:53,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:53,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115419567] [2025-03-17 05:58:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115419567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:58:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304942427] [2025-03-17 05:58:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:55,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:58:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:55,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:58:55,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:58:55,045 INFO L87 Difference]: Start difference. First operand 213 states and 302 transitions. Second operand has 9 states, 6 states have (on average 8.5) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:58:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:56,059 INFO L93 Difference]: Finished difference Result 321 states and 454 transitions. [2025-03-17 05:58:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:58:56,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 8.5) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 138 [2025-03-17 05:58:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:56,062 INFO L225 Difference]: With dead ends: 321 [2025-03-17 05:58:56,062 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 05:58:56,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:58:56,066 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 122 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:56,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 372 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:58:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 05:58:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 108. [2025-03-17 05:58:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:58:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2025-03-17 05:58:56,083 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 138 [2025-03-17 05:58:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:56,084 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2025-03-17 05:58:56,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 8.5) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:58:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2025-03-17 05:58:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:58:56,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:56,086 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:56,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:58:56,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:56,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1531549221, now seen corresponding path program 1 times [2025-03-17 05:58:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141219726] [2025-03-17 05:58:56,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:56,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:58:56,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:58:56,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:56,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141219726] [2025-03-17 05:58:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141219726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:58:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428371773] [2025-03-17 05:58:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:58:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:56,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:58:56,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:58:56,361 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:58:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:56,373 INFO L93 Difference]: Finished difference Result 215 states and 301 transitions. [2025-03-17 05:58:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:58:56,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:58:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:56,375 INFO L225 Difference]: With dead ends: 215 [2025-03-17 05:58:56,375 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:58:56,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:58:56,375 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:56,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:58:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:58:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 05:58:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:58:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2025-03-17 05:58:56,382 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 141 [2025-03-17 05:58:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:56,382 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2025-03-17 05:58:56,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:58:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2025-03-17 05:58:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:58:56,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:56,383 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:56,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:58:56,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:56,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1238146214, now seen corresponding path program 1 times [2025-03-17 05:58:56,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:56,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370877591] [2025-03-17 05:58:56,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:56,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:56,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:58:56,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:58:56,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:56,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370877591] [2025-03-17 05:58:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370877591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:58:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176779497] [2025-03-17 05:58:57,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:57,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:58:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:57,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:58:57,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:58:57,172 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:58:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:57,728 INFO L93 Difference]: Finished difference Result 292 states and 402 transitions. [2025-03-17 05:58:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:58:57,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 141 [2025-03-17 05:58:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:57,734 INFO L225 Difference]: With dead ends: 292 [2025-03-17 05:58:57,734 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 05:58:57,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:58:57,735 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 85 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:57,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 846 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:58:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 05:58:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2025-03-17 05:58:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 149 states have (on average 1.3020134228187918) internal successors, (194), 150 states have internal predecessors, (194), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:58:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 250 transitions. [2025-03-17 05:58:57,756 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 250 transitions. Word has length 141 [2025-03-17 05:58:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:57,756 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 250 transitions. [2025-03-17 05:58:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:58:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 250 transitions. [2025-03-17 05:58:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:58:57,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:57,757 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:57,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:58:57,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:57,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1501009163, now seen corresponding path program 1 times [2025-03-17 05:58:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064538009] [2025-03-17 05:58:57,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:57,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:58:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:58:57,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:57,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:58:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064538009] [2025-03-17 05:58:59,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064538009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:59,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:59,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:58:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265964553] [2025-03-17 05:58:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:59,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:58:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:59,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:58:59,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:58:59,352 INFO L87 Difference]: Start difference. First operand 182 states and 250 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:59:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:00,482 INFO L93 Difference]: Finished difference Result 595 states and 817 transitions. [2025-03-17 05:59:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:59:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2025-03-17 05:59:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:00,487 INFO L225 Difference]: With dead ends: 595 [2025-03-17 05:59:00,487 INFO L226 Difference]: Without dead ends: 414 [2025-03-17 05:59:00,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:59:00,488 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 149 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:00,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 639 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:59:00,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-17 05:59:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 407. [2025-03-17 05:59:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 339 states have (on average 1.3156342182890854) internal successors, (446), 342 states have internal predecessors, (446), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:59:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 562 transitions. [2025-03-17 05:59:00,525 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 562 transitions. Word has length 142 [2025-03-17 05:59:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:00,526 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 562 transitions. [2025-03-17 05:59:00,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:59:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 562 transitions. [2025-03-17 05:59:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:59:00,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:00,528 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:00,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:59:00,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:00,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 997006774, now seen corresponding path program 1 times [2025-03-17 05:59:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:00,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269255591] [2025-03-17 05:59:00,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:00,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:59:00,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:59:00,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:00,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:01,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:01,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269255591] [2025-03-17 05:59:01,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269255591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:01,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:59:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144861378] [2025-03-17 05:59:01,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:01,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:59:01,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:01,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:59:01,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:01,441 INFO L87 Difference]: Start difference. First operand 407 states and 562 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:59:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:01,879 INFO L93 Difference]: Finished difference Result 928 states and 1277 transitions. [2025-03-17 05:59:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:59:01,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2025-03-17 05:59:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:01,883 INFO L225 Difference]: With dead ends: 928 [2025-03-17 05:59:01,885 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 05:59:01,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:01,887 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 46 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:01,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 540 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:59:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 05:59:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 433. [2025-03-17 05:59:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 365 states have (on average 1.3013698630136987) internal successors, (475), 368 states have internal predecessors, (475), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:59:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 591 transitions. [2025-03-17 05:59:01,911 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 591 transitions. Word has length 142 [2025-03-17 05:59:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:01,913 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 591 transitions. [2025-03-17 05:59:01,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:59:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 591 transitions. [2025-03-17 05:59:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:59:01,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:01,917 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:01,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:59:01,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:01,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1909833388, now seen corresponding path program 1 times [2025-03-17 05:59:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221731277] [2025-03-17 05:59:01,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:01,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:59:01,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:59:01,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:01,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:02,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:02,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221731277] [2025-03-17 05:59:02,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221731277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:02,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:02,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:59:02,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453210813] [2025-03-17 05:59:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:02,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:59:02,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:02,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:59:02,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:59:02,097 INFO L87 Difference]: Start difference. First operand 433 states and 591 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:02,353 INFO L93 Difference]: Finished difference Result 954 states and 1302 transitions. [2025-03-17 05:59:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:59:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-17 05:59:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:02,357 INFO L225 Difference]: With dead ends: 954 [2025-03-17 05:59:02,357 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 05:59:02,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:59:02,359 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 46 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:02,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 481 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:59:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 05:59:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 433. [2025-03-17 05:59:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 365 states have (on average 1.2904109589041095) internal successors, (471), 368 states have internal predecessors, (471), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:59:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 587 transitions. [2025-03-17 05:59:02,392 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 587 transitions. Word has length 142 [2025-03-17 05:59:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:02,392 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 587 transitions. [2025-03-17 05:59:02,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 587 transitions. [2025-03-17 05:59:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:59:02,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:02,395 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:59:02,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 588182549, now seen corresponding path program 1 times [2025-03-17 05:59:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:02,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128224513] [2025-03-17 05:59:02,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:02,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:59:02,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:59:02,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:02,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:03,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128224513] [2025-03-17 05:59:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128224513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:03,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:59:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020623904] [2025-03-17 05:59:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:03,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:59:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:03,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:59:03,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:59:03,399 INFO L87 Difference]: Start difference. First operand 433 states and 587 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:04,396 INFO L93 Difference]: Finished difference Result 872 states and 1178 transitions. [2025-03-17 05:59:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:59:04,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-17 05:59:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:04,403 INFO L225 Difference]: With dead ends: 872 [2025-03-17 05:59:04,403 INFO L226 Difference]: Without dead ends: 440 [2025-03-17 05:59:04,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:04,410 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 138 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:04,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 685 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:59:04,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-17 05:59:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 433. [2025-03-17 05:59:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 365 states have (on average 1.2876712328767124) internal successors, (470), 368 states have internal predecessors, (470), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:59:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 586 transitions. [2025-03-17 05:59:04,471 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 586 transitions. Word has length 142 [2025-03-17 05:59:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:04,471 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 586 transitions. [2025-03-17 05:59:04,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 586 transitions. [2025-03-17 05:59:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:59:04,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:04,472 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:04,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:59:04,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1607065102, now seen corresponding path program 1 times [2025-03-17 05:59:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392204853] [2025-03-17 05:59:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:04,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:59:04,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:59:04,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:04,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392204853] [2025-03-17 05:59:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392204853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242658517] [2025-03-17 05:59:04,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:04,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:04,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:04,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:59:04,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:59:04,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:59:04,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:04,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:04,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:59:04,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:04,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:04,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242658517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:04,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:04,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:59:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346234750] [2025-03-17 05:59:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:04,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:04,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:04,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:04,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:59:04,917 INFO L87 Difference]: Start difference. First operand 433 states and 586 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:04,964 INFO L93 Difference]: Finished difference Result 885 states and 1196 transitions. [2025-03-17 05:59:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:59:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:04,969 INFO L225 Difference]: With dead ends: 885 [2025-03-17 05:59:04,969 INFO L226 Difference]: Without dead ends: 453 [2025-03-17 05:59:04,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:59:04,971 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:04,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 705 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-17 05:59:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 447. [2025-03-17 05:59:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 379 states have (on average 1.2770448548812665) internal successors, (484), 382 states have internal predecessors, (484), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:59:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 600 transitions. [2025-03-17 05:59:05,000 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 600 transitions. Word has length 143 [2025-03-17 05:59:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:05,001 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 600 transitions. [2025-03-17 05:59:05,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 600 transitions. [2025-03-17 05:59:05,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:59:05,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:05,002 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:05,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:59:05,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 05:59:05,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:05,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:05,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1574965664, now seen corresponding path program 1 times [2025-03-17 05:59:05,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:05,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132141666] [2025-03-17 05:59:05,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:05,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:59:05,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:59:05,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:05,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:05,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132141666] [2025-03-17 05:59:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132141666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451728201] [2025-03-17 05:59:05,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:05,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:05,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:05,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:05,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:59:05,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:59:05,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:59:05,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:05,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:05,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:59:05,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:05,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:05,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451728201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:05,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:05,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:59:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821531241] [2025-03-17 05:59:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:05,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:59:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:05,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:59:05,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:05,594 INFO L87 Difference]: Start difference. First operand 447 states and 600 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:05,630 INFO L93 Difference]: Finished difference Result 908 states and 1219 transitions. [2025-03-17 05:59:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:59:05,631 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:59:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:05,633 INFO L225 Difference]: With dead ends: 908 [2025-03-17 05:59:05,633 INFO L226 Difference]: Without dead ends: 462 [2025-03-17 05:59:05,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:05,635 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:05,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-17 05:59:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2025-03-17 05:59:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 394 states have (on average 1.266497461928934) internal successors, (499), 397 states have internal predecessors, (499), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:59:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 615 transitions. [2025-03-17 05:59:05,655 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 615 transitions. Word has length 143 [2025-03-17 05:59:05,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:05,655 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 615 transitions. [2025-03-17 05:59:05,656 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 615 transitions. [2025-03-17 05:59:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:59:05,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:05,657 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:05,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:59:05,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:05,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:05,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash 982683576, now seen corresponding path program 1 times [2025-03-17 05:59:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526154895] [2025-03-17 05:59:05,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:05,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:05,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:59:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:59:05,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:05,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526154895] [2025-03-17 05:59:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526154895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:07,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:07,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:59:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101690138] [2025-03-17 05:59:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:07,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:59:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:07,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:59:07,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:07,546 INFO L87 Difference]: Start difference. First operand 462 states and 615 transitions. Second operand has 12 states, 9 states have (on average 6.333333333333333) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:08,872 INFO L93 Difference]: Finished difference Result 719 states and 954 transitions. [2025-03-17 05:59:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:59:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.333333333333333) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-03-17 05:59:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:08,875 INFO L225 Difference]: With dead ends: 719 [2025-03-17 05:59:08,875 INFO L226 Difference]: Without dead ends: 507 [2025-03-17 05:59:08,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:59:08,878 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 57 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:08,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1119 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:59:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-17 05:59:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2025-03-17 05:59:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 432 states have (on average 1.2662037037037037) internal successors, (547), 436 states have internal predecessors, (547), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:59:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 667 transitions. [2025-03-17 05:59:08,902 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 667 transitions. Word has length 144 [2025-03-17 05:59:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:08,902 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 667 transitions. [2025-03-17 05:59:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.333333333333333) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 667 transitions. [2025-03-17 05:59:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:59:08,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:08,903 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:59:08,904 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:08,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1223092008, now seen corresponding path program 1 times [2025-03-17 05:59:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861564846] [2025-03-17 05:59:08,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:08,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:59:08,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:59:08,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:08,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861564846] [2025-03-17 05:59:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861564846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:11,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:11,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:59:11,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503467898] [2025-03-17 05:59:11,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:11,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:59:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:11,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:59:11,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:59:11,790 INFO L87 Difference]: Start difference. First operand 503 states and 667 transitions. Second operand has 16 states, 13 states have (on average 4.384615384615385) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:14,080 INFO L93 Difference]: Finished difference Result 759 states and 1004 transitions. [2025-03-17 05:59:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:59:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.384615384615385) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-03-17 05:59:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:14,087 INFO L225 Difference]: With dead ends: 759 [2025-03-17 05:59:14,087 INFO L226 Difference]: Without dead ends: 506 [2025-03-17 05:59:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:59:14,089 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 254 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:14,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 961 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 05:59:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-17 05:59:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 254. [2025-03-17 05:59:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 218 states have (on average 1.261467889908257) internal successors, (275), 220 states have internal predecessors, (275), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:59:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 335 transitions. [2025-03-17 05:59:14,116 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 335 transitions. Word has length 144 [2025-03-17 05:59:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:14,118 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 335 transitions. [2025-03-17 05:59:14,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.384615384615385) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2025-03-17 05:59:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:59:14,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:14,120 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:14,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:59:14,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:14,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:14,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1882064919, now seen corresponding path program 1 times [2025-03-17 05:59:14,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:14,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727102311] [2025-03-17 05:59:14,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:14,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:59:14,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:59:14,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:14,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727102311] [2025-03-17 05:59:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727102311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583830603] [2025-03-17 05:59:14,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:14,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:14,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:14,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:59:14,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:59:14,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:59:14,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:14,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:14,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:59:14,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:14,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583830603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-17 05:59:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073766227] [2025-03-17 05:59:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:14,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:59:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:14,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:59:14,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:14,614 INFO L87 Difference]: Start difference. First operand 254 states and 335 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:14,749 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2025-03-17 05:59:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:59:14,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:59:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:14,753 INFO L225 Difference]: With dead ends: 525 [2025-03-17 05:59:14,753 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 05:59:14,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:14,754 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:14,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 841 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:59:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 05:59:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 257. [2025-03-17 05:59:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.257918552036199) internal successors, (278), 223 states have internal predecessors, (278), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:59:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 338 transitions. [2025-03-17 05:59:14,782 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 338 transitions. Word has length 145 [2025-03-17 05:59:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:14,782 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 338 transitions. [2025-03-17 05:59:14,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:59:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 338 transitions. [2025-03-17 05:59:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:59:14,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:14,783 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:14,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:59:14,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 05:59:14,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:14,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2016266115, now seen corresponding path program 1 times [2025-03-17 05:59:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:14,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844442862] [2025-03-17 05:59:14,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:15,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:59:15,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:59:15,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:15,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:16,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:16,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844442862] [2025-03-17 05:59:16,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844442862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:16,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:16,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:59:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515806066] [2025-03-17 05:59:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:16,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:59:16,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:16,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:59:16,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:16,470 INFO L87 Difference]: Start difference. First operand 257 states and 338 transitions. Second operand has 8 states, 5 states have (on average 11.6) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:17,068 INFO L93 Difference]: Finished difference Result 682 states and 890 transitions. [2025-03-17 05:59:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:59:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 11.6) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-03-17 05:59:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:17,071 INFO L225 Difference]: With dead ends: 682 [2025-03-17 05:59:17,071 INFO L226 Difference]: Without dead ends: 426 [2025-03-17 05:59:17,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:17,073 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 53 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:17,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 593 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:59:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-17 05:59:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 362. [2025-03-17 05:59:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 323 states have (on average 1.263157894736842) internal successors, (408), 326 states have internal predecessors, (408), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:59:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 472 transitions. [2025-03-17 05:59:17,103 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 472 transitions. Word has length 145 [2025-03-17 05:59:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:17,103 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 472 transitions. [2025-03-17 05:59:17,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 11.6) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 472 transitions. [2025-03-17 05:59:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:59:17,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:17,105 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:17,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:59:17,106 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:17,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 887115582, now seen corresponding path program 1 times [2025-03-17 05:59:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162211272] [2025-03-17 05:59:17,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:17,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:59:17,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:59:17,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:17,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162211272] [2025-03-17 05:59:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162211272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:59:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258330698] [2025-03-17 05:59:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:59:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:18,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:59:18,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:18,190 INFO L87 Difference]: Start difference. First operand 362 states and 472 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:59:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:18,811 INFO L93 Difference]: Finished difference Result 714 states and 924 transitions. [2025-03-17 05:59:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:59:18,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-17 05:59:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:18,814 INFO L225 Difference]: With dead ends: 714 [2025-03-17 05:59:18,814 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 05:59:18,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:59:18,815 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 87 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:18,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 938 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:59:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 05:59:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 532. [2025-03-17 05:59:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 493 states have (on average 1.2636916835699796) internal successors, (623), 496 states have internal predecessors, (623), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:59:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 687 transitions. [2025-03-17 05:59:18,842 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 687 transitions. Word has length 145 [2025-03-17 05:59:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 687 transitions. [2025-03-17 05:59:18,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:59:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 687 transitions. [2025-03-17 05:59:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:59:18,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:18,845 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:18,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:59:18,846 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 10078176, now seen corresponding path program 1 times [2025-03-17 05:59:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790856840] [2025-03-17 05:59:18,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:18,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:18,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:18,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:18,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790856840] [2025-03-17 05:59:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790856840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:21,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 05:59:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109527100] [2025-03-17 05:59:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:21,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:59:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:21,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:59:21,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:59:21,063 INFO L87 Difference]: Start difference. First operand 532 states and 687 transitions. Second operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:24,216 INFO L93 Difference]: Finished difference Result 1300 states and 1661 transitions. [2025-03-17 05:59:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 05:59:24,217 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-17 05:59:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:24,220 INFO L225 Difference]: With dead ends: 1300 [2025-03-17 05:59:24,220 INFO L226 Difference]: Without dead ends: 769 [2025-03-17 05:59:24,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 05:59:24,223 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 285 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:24,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 2422 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 05:59:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-17 05:59:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 533. [2025-03-17 05:59:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 480 states have (on average 1.2541666666666667) internal successors, (602), 482 states have internal predecessors, (602), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:59:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 686 transitions. [2025-03-17 05:59:24,271 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 686 transitions. Word has length 147 [2025-03-17 05:59:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:24,271 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 686 transitions. [2025-03-17 05:59:24,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:59:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 686 transitions. [2025-03-17 05:59:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:59:24,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:24,273 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:59:24,274 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1532572830, now seen corresponding path program 1 times [2025-03-17 05:59:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375777458] [2025-03-17 05:59:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:24,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:24,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:24,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:24,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375777458] [2025-03-17 05:59:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375777458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 05:59:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19086332] [2025-03-17 05:59:26,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:26,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:59:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:26,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:59:26,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:59:26,434 INFO L87 Difference]: Start difference. First operand 533 states and 686 transitions. Second operand has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:59:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:30,582 INFO L93 Difference]: Finished difference Result 1272 states and 1639 transitions. [2025-03-17 05:59:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 05:59:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-17 05:59:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:30,586 INFO L225 Difference]: With dead ends: 1272 [2025-03-17 05:59:30,586 INFO L226 Difference]: Without dead ends: 740 [2025-03-17 05:59:30,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 05:59:30,589 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 247 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:30,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2581 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-17 05:59:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-17 05:59:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 658. [2025-03-17 05:59:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 575 states have (on average 1.2504347826086957) internal successors, (719), 579 states have internal predecessors, (719), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:59:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 851 transitions. [2025-03-17 05:59:30,647 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 851 transitions. Word has length 147 [2025-03-17 05:59:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:30,647 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 851 transitions. [2025-03-17 05:59:30,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:59:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 851 transitions. [2025-03-17 05:59:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:59:30,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:30,649 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:30,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:59:30,650 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1974209135, now seen corresponding path program 1 times [2025-03-17 05:59:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830574711] [2025-03-17 05:59:30,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:30,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:30,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:30,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:30,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830574711] [2025-03-17 05:59:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830574711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:59:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573298323] [2025-03-17 05:59:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:32,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:59:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:32,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:59:32,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:59:32,034 INFO L87 Difference]: Start difference. First operand 658 states and 851 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:59:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:33,191 INFO L93 Difference]: Finished difference Result 1683 states and 2173 transitions. [2025-03-17 05:59:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:59:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-17 05:59:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:33,198 INFO L225 Difference]: With dead ends: 1683 [2025-03-17 05:59:33,199 INFO L226 Difference]: Without dead ends: 1026 [2025-03-17 05:59:33,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:59:33,202 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 205 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:33,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 646 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:59:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-03-17 05:59:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 951. [2025-03-17 05:59:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 834 states have (on average 1.2565947242206235) internal successors, (1048), 839 states have internal predecessors, (1048), 94 states have call successors, (94), 22 states have call predecessors, (94), 22 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 05:59:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1236 transitions. [2025-03-17 05:59:33,286 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1236 transitions. Word has length 147 [2025-03-17 05:59:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:33,287 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1236 transitions. [2025-03-17 05:59:33,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:59:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1236 transitions. [2025-03-17 05:59:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:59:33,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:33,289 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:33,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:59:33,289 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1046866309, now seen corresponding path program 1 times [2025-03-17 05:59:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904474345] [2025-03-17 05:59:33,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:33,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:33,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:33,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:33,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904474345] [2025-03-17 05:59:34,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904474345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116883734] [2025-03-17 05:59:34,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:34,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:34,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:34,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:34,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:59:34,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:35,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:35,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:35,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 05:59:35,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:35,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:59:35,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:35,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:35,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-17 05:59:35,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:35,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 76 [2025-03-17 05:59:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 05:59:35,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:59:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116883734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:59:35,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:59:35,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2025-03-17 05:59:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152384973] [2025-03-17 05:59:35,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:59:35,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 05:59:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:35,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 05:59:35,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:59:35,976 INFO L87 Difference]: Start difference. First operand 951 states and 1236 transitions. Second operand has 24 states, 21 states have (on average 6.380952380952381) internal successors, (134), 24 states have internal predecessors, (134), 8 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 5 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-17 05:59:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:37,250 INFO L93 Difference]: Finished difference Result 1817 states and 2350 transitions. [2025-03-17 05:59:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 05:59:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.380952380952381) internal successors, (134), 24 states have internal predecessors, (134), 8 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 5 states have call predecessors, (52), 8 states have call successors, (52) Word has length 147 [2025-03-17 05:59:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:37,254 INFO L225 Difference]: With dead ends: 1817 [2025-03-17 05:59:37,254 INFO L226 Difference]: Without dead ends: 867 [2025-03-17 05:59:37,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:59:37,256 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 356 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:37,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 535 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:59:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-17 05:59:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 559. [2025-03-17 05:59:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 490 states have (on average 1.2571428571428571) internal successors, (616), 493 states have internal predecessors, (616), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:59:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 720 transitions. [2025-03-17 05:59:37,303 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 720 transitions. Word has length 147 [2025-03-17 05:59:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:37,303 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 720 transitions. [2025-03-17 05:59:37,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.380952380952381) internal successors, (134), 24 states have internal predecessors, (134), 8 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 5 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-17 05:59:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 720 transitions. [2025-03-17 05:59:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:59:37,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:37,305 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:37,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:59:37,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 05:59:37,506 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:37,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1250309489, now seen corresponding path program 1 times [2025-03-17 05:59:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:37,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132788261] [2025-03-17 05:59:37,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:37,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:37,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:37,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:59:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132788261] [2025-03-17 05:59:38,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132788261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:38,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:38,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:59:38,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985254489] [2025-03-17 05:59:38,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:38,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:59:38,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:38,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:59:38,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:59:38,784 INFO L87 Difference]: Start difference. First operand 559 states and 720 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:59:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:39,700 INFO L93 Difference]: Finished difference Result 1437 states and 1848 transitions. [2025-03-17 05:59:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:59:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-17 05:59:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:39,705 INFO L225 Difference]: With dead ends: 1437 [2025-03-17 05:59:39,705 INFO L226 Difference]: Without dead ends: 879 [2025-03-17 05:59:39,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:39,707 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 127 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:39,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 585 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:59:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-17 05:59:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 841. [2025-03-17 05:59:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.2567934782608696) internal successors, (925), 740 states have internal predecessors, (925), 80 states have call successors, (80), 24 states have call predecessors, (80), 24 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:59:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1085 transitions. [2025-03-17 05:59:39,784 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1085 transitions. Word has length 147 [2025-03-17 05:59:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:39,784 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1085 transitions. [2025-03-17 05:59:39,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:59:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1085 transitions. [2025-03-17 05:59:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:59:39,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:39,786 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:39,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:59:39,787 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1770765955, now seen corresponding path program 1 times [2025-03-17 05:59:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742977762] [2025-03-17 05:59:39,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:39,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:39,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:39,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742977762] [2025-03-17 05:59:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742977762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093272755] [2025-03-17 05:59:40,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:40,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:40,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:41,013 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:41,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:59:41,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:59:41,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:59:41,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:41,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:41,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 05:59:41,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:41,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2025-03-17 05:59:41,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2025-03-17 05:59:41,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 63 [2025-03-17 05:59:41,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:41,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 63 [2025-03-17 05:59:41,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:41,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 63 [2025-03-17 05:59:41,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:41,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 63 [2025-03-17 05:59:42,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 63 [2025-03-17 05:59:42,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 54 [2025-03-17 05:59:42,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2025-03-17 05:59:42,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2025-03-17 05:59:42,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 42 [2025-03-17 05:59:42,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2025-03-17 05:59:42,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 30 [2025-03-17 05:59:42,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49 [2025-03-17 05:59:42,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:42,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 21 [2025-03-17 05:59:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 395 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-17 05:59:42,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:59:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093272755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:59:43,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:59:43,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 29 [2025-03-17 05:59:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600182203] [2025-03-17 05:59:43,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:59:43,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 05:59:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:43,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 05:59:43,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:59:43,213 INFO L87 Difference]: Start difference. First operand 841 states and 1085 transitions. Second operand has 29 states, 26 states have (on average 5.615384615384615) internal successors, (146), 29 states have internal predecessors, (146), 8 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2025-03-17 05:59:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:45,108 INFO L93 Difference]: Finished difference Result 1878 states and 2401 transitions. [2025-03-17 05:59:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-17 05:59:45,108 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.615384615384615) internal successors, (146), 29 states have internal predecessors, (146), 8 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) Word has length 147 [2025-03-17 05:59:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:45,112 INFO L225 Difference]: With dead ends: 1878 [2025-03-17 05:59:45,112 INFO L226 Difference]: Without dead ends: 1038 [2025-03-17 05:59:45,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=452, Invalid=2304, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 05:59:45,115 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 343 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:45,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 803 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:59:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-03-17 05:59:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 874. [2025-03-17 05:59:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 738 states have (on average 1.2384823848238482) internal successors, (914), 743 states have internal predecessors, (914), 98 states have call successors, (98), 37 states have call predecessors, (98), 37 states have return successors, (98), 93 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:59:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1110 transitions. [2025-03-17 05:59:45,191 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1110 transitions. Word has length 147 [2025-03-17 05:59:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:45,192 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1110 transitions. [2025-03-17 05:59:45,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.615384615384615) internal successors, (146), 29 states have internal predecessors, (146), 8 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2025-03-17 05:59:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1110 transitions. [2025-03-17 05:59:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:59:45,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:45,193 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:45,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 05:59:45,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:45,394 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:45,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:45,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1327390338, now seen corresponding path program 1 times [2025-03-17 05:59:45,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:45,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591834955] [2025-03-17 05:59:45,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:45,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:59:45,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:59:45,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:45,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591834955] [2025-03-17 05:59:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591834955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88550473] [2025-03-17 05:59:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:46,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:46,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:46,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:46,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:59:46,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:59:46,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:59:46,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:46,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:46,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 05:59:46,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:46,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:59:46,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:46,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:46,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:46,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:46,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:46,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:46,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-03-17 05:59:46,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:46,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 27 [2025-03-17 05:59:46,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:46,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 69 [2025-03-17 05:59:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 311 proven. 30 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-17 05:59:46,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:59:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:59:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88550473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:59:47,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:59:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2025-03-17 05:59:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542926919] [2025-03-17 05:59:47,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:59:47,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:59:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:47,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:59:47,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:59:47,270 INFO L87 Difference]: Start difference. First operand 874 states and 1110 transitions. Second operand has 19 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 6 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 3 states have call predecessors, (45), 6 states have call successors, (45) [2025-03-17 05:59:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:48,587 INFO L93 Difference]: Finished difference Result 1804 states and 2255 transitions. [2025-03-17 05:59:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 05:59:48,588 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 6 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 3 states have call predecessors, (45), 6 states have call successors, (45) Word has length 148 [2025-03-17 05:59:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:48,591 INFO L225 Difference]: With dead ends: 1804 [2025-03-17 05:59:48,591 INFO L226 Difference]: Without dead ends: 1005 [2025-03-17 05:59:48,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 292 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:59:48,592 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 503 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:48,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 419 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:59:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-03-17 05:59:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 825. [2025-03-17 05:59:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 682 states have (on average 1.2067448680351907) internal successors, (823), 687 states have internal predecessors, (823), 98 states have call successors, (98), 44 states have call predecessors, (98), 44 states have return successors, (98), 93 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:59:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1019 transitions. [2025-03-17 05:59:48,671 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1019 transitions. Word has length 148 [2025-03-17 05:59:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:48,672 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1019 transitions. [2025-03-17 05:59:48,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 6 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 3 states have call predecessors, (45), 6 states have call successors, (45) [2025-03-17 05:59:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1019 transitions. [2025-03-17 05:59:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:59:48,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:48,673 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:48,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:59:48,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:48,873 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:48,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2056356374, now seen corresponding path program 1 times [2025-03-17 05:59:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:48,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805400874] [2025-03-17 05:59:48,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:48,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:59:48,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:59:48,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:48,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 05:59:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805400874] [2025-03-17 05:59:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805400874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536837142] [2025-03-17 05:59:50,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:50,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:50,711 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:50,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:59:50,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:59:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:59:51,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:51,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-17 05:59:51,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:51,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-03-17 05:59:51,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2025-03-17 05:59:51,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2025-03-17 05:59:51,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2025-03-17 05:59:51,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2025-03-17 05:59:51,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 34 [2025-03-17 05:59:52,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:52,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 48 [2025-03-17 05:59:52,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:52,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 48 [2025-03-17 05:59:52,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2025-03-17 05:59:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 379 proven. 120 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-17 05:59:52,422 INFO L312 TraceCheckSpWp]: Computing backward predicates...