./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.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 e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:03:57,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:03:57,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:03:57,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:03:57,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:03:57,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:03:57,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:03:57,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:03:57,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:03:57,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:03:57,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:03:57,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:03:57,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:03:57,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:03:57,668 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:03:57,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:03:57,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:03:57,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:03:57,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:57,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:03:57,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:03:57,671 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 -> e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 [2025-03-04 01:03:57,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:03:57,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:03:57,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:03:57,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:03:57,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:03:57,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i [2025-03-04 01:03:59,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb2d8df/e9656106eb5f41579398f4d52bd35aaf/FLAGd3f87aa70 [2025-03-04 01:03:59,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:03:59,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i [2025-03-04 01:03:59,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb2d8df/e9656106eb5f41579398f4d52bd35aaf/FLAGd3f87aa70 [2025-03-04 01:03:59,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb2d8df/e9656106eb5f41579398f4d52bd35aaf [2025-03-04 01:03:59,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:03:59,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:03:59,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:59,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:03:59,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:03:59,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7290bb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59, skipping insertion in model container [2025-03-04 01:03:59,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:03:59,678 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-a_file-27.i[916,929] [2025-03-04 01:03:59,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:59,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:03:59,724 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-a_file-27.i[916,929] [2025-03-04 01:03:59,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:59,766 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:03:59,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59 WrapperNode [2025-03-04 01:03:59,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:59,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:59,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:03:59,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:03:59,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,812 INFO L138 Inliner]: procedures = 26, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-03-04 01:03:59,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:59,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:03:59,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:03:59,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:03:59,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,834 INFO L175 MemorySlicer]: Split 123 memory accesses to 5 slices as follows [2, 16, 70, 11, 24]. 57 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 6, 1, 3]. The 16 writes are split as follows [0, 2, 8, 1, 5]. [2025-03-04 01:03:59,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:03:59,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:03:59,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:03:59,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:03:59,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (1/1) ... [2025-03-04 01:03:59,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:59,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:59,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:03:59,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:03:59,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:03:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:03:59,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:03:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:03:59,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:04:00,013 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:04:00,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:04:00,350 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem67#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite74#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite100#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite117#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1; [2025-03-04 01:04:00,381 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-04 01:04:00,381 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:04:00,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:04:00,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:04:00,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:04:00 BoogieIcfgContainer [2025-03-04 01:04:00,392 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:04:00,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:04:00,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:04:00,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:04:00,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:03:59" (1/3) ... [2025-03-04 01:04:00,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26972527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:04:00, skipping insertion in model container [2025-03-04 01:04:00,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:59" (2/3) ... [2025-03-04 01:04:00,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26972527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:04:00, skipping insertion in model container [2025-03-04 01:04:00,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:04:00" (3/3) ... [2025-03-04 01:04:00,399 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-27.i [2025-03-04 01:04:00,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:04:00,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-27.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:04:00,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:04:00,466 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;@4643e6e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:04:00,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:04:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:04:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:04:00,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:00,478 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:00,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:00,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash 887028870, now seen corresponding path program 1 times [2025-03-04 01:04:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195494514] [2025-03-04 01:04:00,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:00,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:04:00,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:04:00,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:00,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:04:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195494514] [2025-03-04 01:04:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195494514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:00,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910845186] [2025-03-04 01:04:00,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:00,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:00,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:00,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:04:00,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:04:00,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:04:00,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:04:00,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:00,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:00,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:04:00,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:04:00,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910845186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:04:00,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632405832] [2025-03-04 01:04:00,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:00,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:04:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:00,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:04:00,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:04:00,938 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:00,957 INFO L93 Difference]: Finished difference Result 180 states and 280 transitions. [2025-03-04 01:04:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:04:00,960 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-04 01:04:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:00,964 INFO L225 Difference]: With dead ends: 180 [2025-03-04 01:04:00,964 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 01:04:00,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:04:00,968 INFO L435 NwaCegarLoop]: 129 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, 129 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-04 01:04:00,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 01:04:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 01:04:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:04:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-03-04 01:04:00,996 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 131 [2025-03-04 01:04:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:00,996 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-03-04 01:04:00,996 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-03-04 01:04:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:04:00,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:00,998 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:01,005 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-04 01:04:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:04:01,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:01,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash 564543445, now seen corresponding path program 1 times [2025-03-04 01:04:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987026078] [2025-03-04 01:04:01,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:01,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:04:01,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:04:01,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:01,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:01,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987026078] [2025-03-04 01:04:01,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987026078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:01,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:01,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799469062] [2025-03-04 01:04:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:01,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:01,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:01,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:01,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:01,981 INFO L87 Difference]: Start difference. First operand 90 states and 129 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:02,091 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-03-04 01:04:02,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:02,092 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-04 01:04:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:02,093 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:04:02,093 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:04:02,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:02,094 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 147 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:02,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 446 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:04:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2025-03-04 01:04:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 121 states have internal predecessors, (166), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:04:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 204 transitions. [2025-03-04 01:04:02,115 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 204 transitions. Word has length 131 [2025-03-04 01:04:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:02,118 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 204 transitions. [2025-03-04 01:04:02,118 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 204 transitions. [2025-03-04 01:04:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:04:02,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:02,121 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:02,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:04:02,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:02,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:02,122 INFO L85 PathProgramCache]: Analyzing trace with hash -279928426, now seen corresponding path program 1 times [2025-03-04 01:04:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:02,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290436045] [2025-03-04 01:04:02,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:02,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:04:02,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:04:02,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:02,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290436045] [2025-03-04 01:04:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290436045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:02,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:04:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690088000] [2025-03-04 01:04:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:02,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:04:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:02,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:04:02,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:04:02,556 INFO L87 Difference]: Start difference. First operand 142 states and 204 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:02,707 INFO L93 Difference]: Finished difference Result 420 states and 606 transitions. [2025-03-04 01:04:02,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:04:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-04 01:04:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:02,713 INFO L225 Difference]: With dead ends: 420 [2025-03-04 01:04:02,715 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 01:04:02,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:04:02,717 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 80 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:02,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 377 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 01:04:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2025-03-04 01:04:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 232 states have (on average 1.3793103448275863) internal successors, (320), 234 states have internal predecessors, (320), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:04:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 396 transitions. [2025-03-04 01:04:02,752 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 396 transitions. Word has length 131 [2025-03-04 01:04:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:02,752 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 396 transitions. [2025-03-04 01:04:02,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 396 transitions. [2025-03-04 01:04:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:04:02,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:02,758 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:04:02,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:02,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1809307926, now seen corresponding path program 1 times [2025-03-04 01:04:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061345041] [2025-03-04 01:04:02,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:02,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:04:02,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:04:02,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:02,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061345041] [2025-03-04 01:04:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061345041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156343718] [2025-03-04 01:04:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:03,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:03,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:03,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:03,175 INFO L87 Difference]: Start difference. First operand 275 states and 396 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:03,295 INFO L93 Difference]: Finished difference Result 659 states and 940 transitions. [2025-03-04 01:04:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:03,296 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-04 01:04:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:03,299 INFO L225 Difference]: With dead ends: 659 [2025-03-04 01:04:03,301 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 01:04:03,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:03,304 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 130 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:03,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 642 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 01:04:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2025-03-04 01:04:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3333333333333333) internal successors, (232), 174 states have internal predecessors, (232), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:04:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 300 transitions. [2025-03-04 01:04:03,332 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 300 transitions. Word has length 131 [2025-03-04 01:04:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 300 transitions. [2025-03-04 01:04:03,336 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 300 transitions. [2025-03-04 01:04:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:04:03,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:03,340 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:04:03,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:03,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1220380393, now seen corresponding path program 1 times [2025-03-04 01:04:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033890464] [2025-03-04 01:04:03,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:03,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:04:03,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:04:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033890464] [2025-03-04 01:04:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033890464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:04:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130346030] [2025-03-04 01:04:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:04,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:04:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:04,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:04:04,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:04,127 INFO L87 Difference]: Start difference. First operand 213 states and 300 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:04,542 INFO L93 Difference]: Finished difference Result 453 states and 631 transitions. [2025-03-04 01:04:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:04:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-04 01:04:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:04,544 INFO L225 Difference]: With dead ends: 453 [2025-03-04 01:04:04,545 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 01:04:04,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:04:04,545 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 194 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:04,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 885 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:04:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 01:04:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 285. [2025-03-04 01:04:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 238 states have (on average 1.3361344537815125) internal successors, (318), 239 states have internal predecessors, (318), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:04:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 398 transitions. [2025-03-04 01:04:04,574 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 398 transitions. Word has length 132 [2025-03-04 01:04:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:04,575 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 398 transitions. [2025-03-04 01:04:04,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 398 transitions. [2025-03-04 01:04:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:04:04,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:04,577 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:04,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:04:04,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash 287171416, now seen corresponding path program 1 times [2025-03-04 01:04:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666563352] [2025-03-04 01:04:04,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:04,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:04:04,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:04:04,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:04,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:05,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:05,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666563352] [2025-03-04 01:04:05,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666563352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:05,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:05,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917168626] [2025-03-04 01:04:05,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:05,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:05,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:05,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:05,209 INFO L87 Difference]: Start difference. First operand 285 states and 398 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:05,430 INFO L93 Difference]: Finished difference Result 584 states and 811 transitions. [2025-03-04 01:04:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:04:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:05,433 INFO L225 Difference]: With dead ends: 584 [2025-03-04 01:04:05,433 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 01:04:05,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:04:05,434 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 69 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:05,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 680 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 01:04:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 298. [2025-03-04 01:04:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 251 states have (on average 1.3386454183266931) internal successors, (336), 252 states have internal predecessors, (336), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:04:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 416 transitions. [2025-03-04 01:04:05,455 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 416 transitions. Word has length 132 [2025-03-04 01:04:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:05,455 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 416 transitions. [2025-03-04 01:04:05,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 416 transitions. [2025-03-04 01:04:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:04:05,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:05,457 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:05,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:04:05,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1764444269, now seen corresponding path program 1 times [2025-03-04 01:04:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223204971] [2025-03-04 01:04:05,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:05,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:04:05,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:04:05,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:05,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223204971] [2025-03-04 01:04:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223204971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:04:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570060642] [2025-03-04 01:04:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:05,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:04:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:05,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:04:05,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:04:05,718 INFO L87 Difference]: Start difference. First operand 298 states and 416 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:05,841 INFO L93 Difference]: Finished difference Result 601 states and 838 transitions. [2025-03-04 01:04:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:04:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-04 01:04:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:05,843 INFO L225 Difference]: With dead ends: 601 [2025-03-04 01:04:05,843 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 01:04:05,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:04:05,844 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 72 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:05,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 373 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 01:04:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2025-03-04 01:04:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 251 states have (on average 1.3346613545816732) internal successors, (335), 252 states have internal predecessors, (335), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:04:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 415 transitions. [2025-03-04 01:04:05,867 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 415 transitions. Word has length 133 [2025-03-04 01:04:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:05,869 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 415 transitions. [2025-03-04 01:04:05,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 415 transitions. [2025-03-04 01:04:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:04:05,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:05,870 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:05,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:04:05,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash 699314900, now seen corresponding path program 1 times [2025-03-04 01:04:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467964524] [2025-03-04 01:04:05,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:05,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:04:05,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:04:05,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:05,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467964524] [2025-03-04 01:04:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467964524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:04:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698014036] [2025-03-04 01:04:06,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:06,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:06,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:06,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:04:06,047 INFO L87 Difference]: Start difference. First operand 298 states and 415 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:06,235 INFO L93 Difference]: Finished difference Result 601 states and 836 transitions. [2025-03-04 01:04:06,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:06,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-03-04 01:04:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:06,237 INFO L225 Difference]: With dead ends: 601 [2025-03-04 01:04:06,237 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 01:04:06,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:06,238 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 113 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:06,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 463 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 01:04:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 389. [2025-03-04 01:04:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 322 states have (on average 1.3229813664596273) internal successors, (426), 323 states have internal predecessors, (426), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 01:04:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 540 transitions. [2025-03-04 01:04:06,267 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 540 transitions. Word has length 134 [2025-03-04 01:04:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:06,268 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 540 transitions. [2025-03-04 01:04:06,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 540 transitions. [2025-03-04 01:04:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:04:06,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:06,272 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:06,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:04:06,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1025690742, now seen corresponding path program 1 times [2025-03-04 01:04:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:06,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240890861] [2025-03-04 01:04:06,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:06,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:04:06,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:04:06,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240890861] [2025-03-04 01:04:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240890861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:04:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743010138] [2025-03-04 01:04:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:06,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:06,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:04:06,438 INFO L87 Difference]: Start difference. First operand 389 states and 540 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:06,633 INFO L93 Difference]: Finished difference Result 707 states and 979 transitions. [2025-03-04 01:04:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-03-04 01:04:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:06,635 INFO L225 Difference]: With dead ends: 707 [2025-03-04 01:04:06,635 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 01:04:06,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:06,638 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 109 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:06,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 538 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 01:04:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 287. [2025-03-04 01:04:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 239 states have (on average 1.3054393305439331) internal successors, (312), 240 states have internal predecessors, (312), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:04:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 392 transitions. [2025-03-04 01:04:06,658 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 392 transitions. Word has length 134 [2025-03-04 01:04:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:06,658 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 392 transitions. [2025-03-04 01:04:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 392 transitions. [2025-03-04 01:04:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:04:06,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:06,659 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:06,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:04:06,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:06,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:06,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2142970297, now seen corresponding path program 1 times [2025-03-04 01:04:06,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:06,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583419151] [2025-03-04 01:04:06,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:06,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:04:06,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:04:06,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:07,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:07,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583419151] [2025-03-04 01:04:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583419151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:07,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:04:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875882553] [2025-03-04 01:04:07,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:07,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:04:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:07,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:04:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:07,456 INFO L87 Difference]: Start difference. First operand 287 states and 392 transitions. Second operand has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:04:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:07,827 INFO L93 Difference]: Finished difference Result 812 states and 1102 transitions. [2025-03-04 01:04:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:04:07,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-04 01:04:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:07,830 INFO L225 Difference]: With dead ends: 812 [2025-03-04 01:04:07,830 INFO L226 Difference]: Without dead ends: 528 [2025-03-04 01:04:07,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:04:07,831 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 74 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:07,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 785 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:04:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-04 01:04:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 524. [2025-03-04 01:04:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 447 states have (on average 1.2975391498881432) internal successors, (580), 451 states have internal predecessors, (580), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 704 transitions. [2025-03-04 01:04:07,862 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 704 transitions. Word has length 135 [2025-03-04 01:04:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:07,863 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 704 transitions. [2025-03-04 01:04:07,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:04:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 704 transitions. [2025-03-04 01:04:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:04:07,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:07,864 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:04:07,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:07,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 813006321, now seen corresponding path program 1 times [2025-03-04 01:04:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440460306] [2025-03-04 01:04:07,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:07,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:04:07,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:04:07,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:07,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440460306] [2025-03-04 01:04:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440460306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:04:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137099283] [2025-03-04 01:04:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:08,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:04:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:08,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:04:08,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:08,367 INFO L87 Difference]: Start difference. First operand 524 states and 704 transitions. Second operand has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:04:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:08,642 INFO L93 Difference]: Finished difference Result 1285 states and 1720 transitions. [2025-03-04 01:04:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:04:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-04 01:04:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:08,646 INFO L225 Difference]: With dead ends: 1285 [2025-03-04 01:04:08,646 INFO L226 Difference]: Without dead ends: 764 [2025-03-04 01:04:08,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:04:08,647 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 62 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:08,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 825 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-04 01:04:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 758. [2025-03-04 01:04:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 657 states have (on average 1.299847792998478) internal successors, (854), 665 states have internal predecessors, (854), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:04:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1010 transitions. [2025-03-04 01:04:08,710 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1010 transitions. Word has length 135 [2025-03-04 01:04:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:08,710 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1010 transitions. [2025-03-04 01:04:08,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:04:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1010 transitions. [2025-03-04 01:04:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:04:08,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:08,712 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:08,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:04:08,713 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:08,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash 942089040, now seen corresponding path program 1 times [2025-03-04 01:04:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:08,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170265488] [2025-03-04 01:04:08,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:08,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:04:08,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:04:08,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:08,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:09,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:09,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170265488] [2025-03-04 01:04:09,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170265488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:09,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:04:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864394881] [2025-03-04 01:04:09,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:09,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:04:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:09,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:04:09,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:04:09,238 INFO L87 Difference]: Start difference. First operand 758 states and 1010 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:09,622 INFO L93 Difference]: Finished difference Result 1532 states and 2035 transitions. [2025-03-04 01:04:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:04:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-04 01:04:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:09,626 INFO L225 Difference]: With dead ends: 1532 [2025-03-04 01:04:09,626 INFO L226 Difference]: Without dead ends: 777 [2025-03-04 01:04:09,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:04:09,628 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 61 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:09,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1357 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:04:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-04 01:04:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 754. [2025-03-04 01:04:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 653 states have (on average 1.2924961715160797) internal successors, (844), 661 states have internal predecessors, (844), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:04:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1000 transitions. [2025-03-04 01:04:09,674 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1000 transitions. Word has length 135 [2025-03-04 01:04:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:09,674 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1000 transitions. [2025-03-04 01:04:09,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1000 transitions. [2025-03-04 01:04:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:04:09,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:09,676 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:09,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:04:09,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:09,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1221830546, now seen corresponding path program 1 times [2025-03-04 01:04:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620613679] [2025-03-04 01:04:09,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:09,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:04:09,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:04:09,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620613679] [2025-03-04 01:04:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620613679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:10,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:04:10,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174996407] [2025-03-04 01:04:10,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:10,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:04:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:10,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:04:10,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:04:10,345 INFO L87 Difference]: Start difference. First operand 754 states and 1000 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:10,726 INFO L93 Difference]: Finished difference Result 1553 states and 2052 transitions. [2025-03-04 01:04:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:04:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-04 01:04:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:10,730 INFO L225 Difference]: With dead ends: 1553 [2025-03-04 01:04:10,730 INFO L226 Difference]: Without dead ends: 802 [2025-03-04 01:04:10,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:04:10,731 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 71 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:10,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1186 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:04:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-04 01:04:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 667. [2025-03-04 01:04:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 570 states have (on average 1.275438596491228) internal successors, (727), 576 states have internal predecessors, (727), 74 states have call successors, (74), 22 states have call predecessors, (74), 22 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:04:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 875 transitions. [2025-03-04 01:04:10,769 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 875 transitions. Word has length 135 [2025-03-04 01:04:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:10,770 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 875 transitions. [2025-03-04 01:04:10,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 875 transitions. [2025-03-04 01:04:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:04:10,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:10,771 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:04:10,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1350913265, now seen corresponding path program 1 times [2025-03-04 01:04:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131330985] [2025-03-04 01:04:10,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:10,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:04:10,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:04:10,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:10,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:11,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131330985] [2025-03-04 01:04:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131330985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:11,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:04:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663744010] [2025-03-04 01:04:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:04:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:11,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:04:11,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:04:11,232 INFO L87 Difference]: Start difference. First operand 667 states and 875 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:11,500 INFO L93 Difference]: Finished difference Result 1333 states and 1743 transitions. [2025-03-04 01:04:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:04:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-04 01:04:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:11,504 INFO L225 Difference]: With dead ends: 1333 [2025-03-04 01:04:11,504 INFO L226 Difference]: Without dead ends: 669 [2025-03-04 01:04:11,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:11,508 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:11,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 937 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-04 01:04:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 564. [2025-03-04 01:04:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 487 states have internal predecessors, (614), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 738 transitions. [2025-03-04 01:04:11,542 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 738 transitions. Word has length 135 [2025-03-04 01:04:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:11,542 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 738 transitions. [2025-03-04 01:04:11,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 738 transitions. [2025-03-04 01:04:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:04:11,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:11,544 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:11,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:04:11,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2111950490, now seen corresponding path program 1 times [2025-03-04 01:04:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376924336] [2025-03-04 01:04:11,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:11,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:04:11,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:04:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:11,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376924336] [2025-03-04 01:04:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376924336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:11,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:04:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469065778] [2025-03-04 01:04:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:11,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:11,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:11,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:04:11,680 INFO L87 Difference]: Start difference. First operand 564 states and 738 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:11,763 INFO L93 Difference]: Finished difference Result 1132 states and 1482 transitions. [2025-03-04 01:04:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:04:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-04 01:04:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:11,767 INFO L225 Difference]: With dead ends: 1132 [2025-03-04 01:04:11,767 INFO L226 Difference]: Without dead ends: 571 [2025-03-04 01:04:11,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:11,769 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 51 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:11,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 541 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-04 01:04:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2025-03-04 01:04:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 486 states have (on average 1.2695473251028806) internal successors, (617), 490 states have internal predecessors, (617), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 741 transitions. [2025-03-04 01:04:11,814 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 741 transitions. Word has length 135 [2025-03-04 01:04:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:11,814 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 741 transitions. [2025-03-04 01:04:11,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 741 transitions. [2025-03-04 01:04:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:04:11,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:11,816 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:11,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:04:11,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash 386065447, now seen corresponding path program 1 times [2025-03-04 01:04:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271002963] [2025-03-04 01:04:11,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:04:11,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:04:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:12,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:12,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271002963] [2025-03-04 01:04:12,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271002963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:12,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:12,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:12,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538712805] [2025-03-04 01:04:12,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:12,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:12,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:12,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:12,012 INFO L87 Difference]: Start difference. First operand 567 states and 741 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:12,117 INFO L93 Difference]: Finished difference Result 1240 states and 1618 transitions. [2025-03-04 01:04:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-04 01:04:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:12,120 INFO L225 Difference]: With dead ends: 1240 [2025-03-04 01:04:12,121 INFO L226 Difference]: Without dead ends: 676 [2025-03-04 01:04:12,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:12,122 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:12,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 566 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-04 01:04:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 581. [2025-03-04 01:04:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 500 states have (on average 1.252) internal successors, (626), 504 states have internal predecessors, (626), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 750 transitions. [2025-03-04 01:04:12,155 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 750 transitions. Word has length 135 [2025-03-04 01:04:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:12,156 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 750 transitions. [2025-03-04 01:04:12,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 750 transitions. [2025-03-04 01:04:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:12,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:12,157 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:12,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:04:12,158 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:12,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash -129115165, now seen corresponding path program 1 times [2025-03-04 01:04:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:12,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531440604] [2025-03-04 01:04:12,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:12,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:12,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:12,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:04:12,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531440604] [2025-03-04 01:04:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531440604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056386367] [2025-03-04 01:04:12,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:12,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:12,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:12,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:04:12,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:04:12,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:12,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:12,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:12,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:12,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:04:12,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:12,602 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 29 treesize of output 13 [2025-03-04 01:04:12,624 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 29 treesize of output 13 [2025-03-04 01:04:12,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 01:04:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 268 proven. 30 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-04 01:04:12,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:04:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:04:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056386367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:04:12,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:04:12,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 01:04:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873592578] [2025-03-04 01:04:12,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:04:12,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:04:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:12,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:04:12,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:04:12,894 INFO L87 Difference]: Start difference. First operand 581 states and 750 transitions. Second operand has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2025-03-04 01:04:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:13,217 INFO L93 Difference]: Finished difference Result 1147 states and 1464 transitions. [2025-03-04 01:04:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:04:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) Word has length 139 [2025-03-04 01:04:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:13,220 INFO L225 Difference]: With dead ends: 1147 [2025-03-04 01:04:13,220 INFO L226 Difference]: Without dead ends: 569 [2025-03-04 01:04:13,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:04:13,222 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 141 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:13,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 424 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-04 01:04:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 541. [2025-03-04 01:04:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 456 states have (on average 1.230263157894737) internal successors, (561), 460 states have internal predecessors, (561), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 685 transitions. [2025-03-04 01:04:13,254 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 685 transitions. Word has length 139 [2025-03-04 01:04:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:13,254 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 685 transitions. [2025-03-04 01:04:13,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2025-03-04 01:04:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 685 transitions. [2025-03-04 01:04:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:13,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:13,256 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:13,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:04:13,456 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,SelfDestructingSolverStorable16 [2025-03-04 01:04:13,457 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:13,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1424412155, now seen corresponding path program 1 times [2025-03-04 01:04:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097516194] [2025-03-04 01:04:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:13,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:13,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:13,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:13,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097516194] [2025-03-04 01:04:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097516194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:13,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999392542] [2025-03-04 01:04:13,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:13,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:13,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:13,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:13,725 INFO L87 Difference]: Start difference. First operand 541 states and 685 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:13,911 INFO L93 Difference]: Finished difference Result 1481 states and 1874 transitions. [2025-03-04 01:04:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:13,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-04 01:04:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:13,916 INFO L225 Difference]: With dead ends: 1481 [2025-03-04 01:04:13,916 INFO L226 Difference]: Without dead ends: 943 [2025-03-04 01:04:13,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:13,917 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 61 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:13,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 441 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-04 01:04:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 681. [2025-03-04 01:04:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 596 states have (on average 1.2432885906040267) internal successors, (741), 600 states have internal predecessors, (741), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 865 transitions. [2025-03-04 01:04:13,953 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 865 transitions. Word has length 139 [2025-03-04 01:04:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:13,953 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 865 transitions. [2025-03-04 01:04:13,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 865 transitions. [2025-03-04 01:04:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:13,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:13,955 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:13,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:04:13,955 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:13,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1063100678, now seen corresponding path program 1 times [2025-03-04 01:04:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:13,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478148420] [2025-03-04 01:04:13,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:13,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:14,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:14,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:14,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:14,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:14,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478148420] [2025-03-04 01:04:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478148420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:14,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:14,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:04:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122188494] [2025-03-04 01:04:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:14,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:04:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:14,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:04:14,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:04:14,500 INFO L87 Difference]: Start difference. First operand 681 states and 865 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:14,884 INFO L93 Difference]: Finished difference Result 1529 states and 1938 transitions. [2025-03-04 01:04:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:04:14,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-04 01:04:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:14,888 INFO L225 Difference]: With dead ends: 1529 [2025-03-04 01:04:14,888 INFO L226 Difference]: Without dead ends: 851 [2025-03-04 01:04:14,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:04:14,889 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 63 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:14,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1224 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:04:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-04 01:04:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 697. [2025-03-04 01:04:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 612 states have (on average 1.2369281045751634) internal successors, (757), 616 states have internal predecessors, (757), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 881 transitions. [2025-03-04 01:04:14,920 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 881 transitions. Word has length 139 [2025-03-04 01:04:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:14,920 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 881 transitions. [2025-03-04 01:04:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 881 transitions. [2025-03-04 01:04:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:14,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:14,922 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:14,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:04:14,922 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:14,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1825924609, now seen corresponding path program 1 times [2025-03-04 01:04:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:14,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983899807] [2025-03-04 01:04:14,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:14,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:14,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:14,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:14,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983899807] [2025-03-04 01:04:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983899807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881911330] [2025-03-04 01:04:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:15,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:15,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:15,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:15,092 INFO L87 Difference]: Start difference. First operand 697 states and 881 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:15,191 INFO L93 Difference]: Finished difference Result 1506 states and 1907 transitions. [2025-03-04 01:04:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-04 01:04:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:15,195 INFO L225 Difference]: With dead ends: 1506 [2025-03-04 01:04:15,195 INFO L226 Difference]: Without dead ends: 812 [2025-03-04 01:04:15,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:15,198 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:15,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 563 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-04 01:04:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 725. [2025-03-04 01:04:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 640 states have (on average 1.2375) internal successors, (792), 644 states have internal predecessors, (792), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 916 transitions. [2025-03-04 01:04:15,231 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 916 transitions. Word has length 139 [2025-03-04 01:04:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:15,231 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 916 transitions. [2025-03-04 01:04:15,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2025-03-04 01:04:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:15,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:15,233 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:15,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:04:15,233 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:15,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash 18470146, now seen corresponding path program 1 times [2025-03-04 01:04:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:15,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323679197] [2025-03-04 01:04:15,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:15,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:15,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:15,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:15,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:04:15,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323679197] [2025-03-04 01:04:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323679197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483963729] [2025-03-04 01:04:15,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:15,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:15,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:04:15,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:04:15,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:15,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:15,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:15,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:15,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:04:15,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:15,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483963729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:04:15,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975704190] [2025-03-04 01:04:15,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:15,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:15,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:15,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:04:15,552 INFO L87 Difference]: Start difference. First operand 725 states and 916 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:15,614 INFO L93 Difference]: Finished difference Result 1468 states and 1856 transitions. [2025-03-04 01:04:15,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:15,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-04 01:04:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:15,618 INFO L225 Difference]: With dead ends: 1468 [2025-03-04 01:04:15,618 INFO L226 Difference]: Without dead ends: 746 [2025-03-04 01:04:15,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 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-04 01:04:15,621 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:15,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-04 01:04:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 734. [2025-03-04 01:04:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 649 states have (on average 1.234206471494607) internal successors, (801), 653 states have internal predecessors, (801), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 925 transitions. [2025-03-04 01:04:15,662 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 925 transitions. Word has length 139 [2025-03-04 01:04:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:15,663 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 925 transitions. [2025-03-04 01:04:15,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 925 transitions. [2025-03-04 01:04:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:15,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:15,664 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:15,671 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-04 01:04:15,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:15,869 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:15,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1476039638, now seen corresponding path program 1 times [2025-03-04 01:04:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760433515] [2025-03-04 01:04:15,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:15,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:15,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:15,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:15,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760433515] [2025-03-04 01:04:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760433515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:16,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107780397] [2025-03-04 01:04:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:16,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:16,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:16,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:16,149 INFO L87 Difference]: Start difference. First operand 734 states and 925 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:16,249 INFO L93 Difference]: Finished difference Result 1595 states and 2003 transitions. [2025-03-04 01:04:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-04 01:04:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:16,254 INFO L225 Difference]: With dead ends: 1595 [2025-03-04 01:04:16,255 INFO L226 Difference]: Without dead ends: 780 [2025-03-04 01:04:16,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:16,258 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 109 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:16,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 579 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-04 01:04:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 690. [2025-03-04 01:04:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 605 states have (on average 1.2132231404958678) internal successors, (734), 609 states have internal predecessors, (734), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 858 transitions. [2025-03-04 01:04:16,289 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 858 transitions. Word has length 139 [2025-03-04 01:04:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:16,289 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 858 transitions. [2025-03-04 01:04:16,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 858 transitions. [2025-03-04 01:04:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:16,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:16,291 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:16,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:04:16,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:16,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash 31512171, now seen corresponding path program 1 times [2025-03-04 01:04:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:16,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880443707] [2025-03-04 01:04:16,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:16,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:16,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:16,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:16,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:16,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880443707] [2025-03-04 01:04:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880443707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:04:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226348287] [2025-03-04 01:04:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:16,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:04:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:16,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:04:16,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:04:16,959 INFO L87 Difference]: Start difference. First operand 690 states and 858 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:17,672 INFO L93 Difference]: Finished difference Result 1703 states and 2102 transitions. [2025-03-04 01:04:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:04:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-04 01:04:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:17,676 INFO L225 Difference]: With dead ends: 1703 [2025-03-04 01:04:17,676 INFO L226 Difference]: Without dead ends: 1016 [2025-03-04 01:04:17,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:04:17,678 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 343 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:17,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 578 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:04:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-04 01:04:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 772. [2025-03-04 01:04:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 675 states have (on average 1.208888888888889) internal successors, (816), 681 states have internal predecessors, (816), 70 states have call successors, (70), 26 states have call predecessors, (70), 26 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:04:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 956 transitions. [2025-03-04 01:04:17,721 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 956 transitions. Word has length 139 [2025-03-04 01:04:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:17,721 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 956 transitions. [2025-03-04 01:04:17,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 956 transitions. [2025-03-04 01:04:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:04:17,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:17,723 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:17,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:04:17,724 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:17,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1013118361, now seen corresponding path program 1 times [2025-03-04 01:04:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049495570] [2025-03-04 01:04:17,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:17,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:17,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:04:17,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:04:17,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049495570] [2025-03-04 01:04:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049495570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:17,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:04:17,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6034150] [2025-03-04 01:04:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:17,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:04:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:17,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:04:17,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:17,901 INFO L87 Difference]: Start difference. First operand 772 states and 956 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:18,089 INFO L93 Difference]: Finished difference Result 1710 states and 2112 transitions. [2025-03-04 01:04:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:04:18,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-04 01:04:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:18,094 INFO L225 Difference]: With dead ends: 1710 [2025-03-04 01:04:18,094 INFO L226 Difference]: Without dead ends: 941 [2025-03-04 01:04:18,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:04:18,097 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 53 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:18,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 837 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-04 01:04:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 812. [2025-03-04 01:04:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 715 states have (on average 1.2111888111888112) internal successors, (866), 721 states have internal predecessors, (866), 70 states have call successors, (70), 26 states have call predecessors, (70), 26 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:04:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1006 transitions. [2025-03-04 01:04:18,140 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1006 transitions. Word has length 139 [2025-03-04 01:04:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:18,141 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1006 transitions. [2025-03-04 01:04:18,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1006 transitions. [2025-03-04 01:04:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 01:04:18,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:18,142 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:18,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:04:18,143 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -676503386, now seen corresponding path program 1 times [2025-03-04 01:04:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173386763] [2025-03-04 01:04:18,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:18,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 01:04:18,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 01:04:18,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:18,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:18,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173386763] [2025-03-04 01:04:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173386763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:18,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:18,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:04:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315588423] [2025-03-04 01:04:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:18,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:18,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:18,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:04:18,585 INFO L87 Difference]: Start difference. First operand 812 states and 1006 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:18,795 INFO L93 Difference]: Finished difference Result 1684 states and 2079 transitions. [2025-03-04 01:04:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:04:18,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-03-04 01:04:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:18,799 INFO L225 Difference]: With dead ends: 1684 [2025-03-04 01:04:18,799 INFO L226 Difference]: Without dead ends: 875 [2025-03-04 01:04:18,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-04 01:04:18,800 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:18,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 421 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-04 01:04:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 745. [2025-03-04 01:04:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 658 states have (on average 1.2051671732522797) internal successors, (793), 662 states have internal predecessors, (793), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:04:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 917 transitions. [2025-03-04 01:04:18,842 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 917 transitions. Word has length 140 [2025-03-04 01:04:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 917 transitions. [2025-03-04 01:04:18,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 917 transitions. [2025-03-04 01:04:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:04:18,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:18,845 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:18,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:04:18,846 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1217089090, now seen corresponding path program 1 times [2025-03-04 01:04:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629851528] [2025-03-04 01:04:18,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:18,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:04:18,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:04:18,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:18,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629851528] [2025-03-04 01:04:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629851528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:04:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004678332] [2025-03-04 01:04:19,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:19,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:04:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:19,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:04:19,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:04:19,151 INFO L87 Difference]: Start difference. First operand 745 states and 917 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:19,356 INFO L93 Difference]: Finished difference Result 1221 states and 1472 transitions. [2025-03-04 01:04:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:04:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-03-04 01:04:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:19,364 INFO L225 Difference]: With dead ends: 1221 [2025-03-04 01:04:19,364 INFO L226 Difference]: Without dead ends: 1219 [2025-03-04 01:04:19,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:04:19,365 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:19,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1025 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-04 01:04:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1215. [2025-03-04 01:04:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1052 states have (on average 1.173003802281369) internal successors, (1234), 1062 states have internal predecessors, (1234), 114 states have call successors, (114), 48 states have call predecessors, (114), 48 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-04 01:04:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1462 transitions. [2025-03-04 01:04:19,438 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1462 transitions. Word has length 141 [2025-03-04 01:04:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:19,438 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1462 transitions. [2025-03-04 01:04:19,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1462 transitions. [2025-03-04 01:04:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:04:19,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:19,440 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:19,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:04:19,441 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:19,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:19,442 INFO L85 PathProgramCache]: Analyzing trace with hash 696207071, now seen corresponding path program 1 times [2025-03-04 01:04:19,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:19,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903291457] [2025-03-04 01:04:19,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:19,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:19,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:04:19,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:04:19,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:19,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:19,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903291457] [2025-03-04 01:04:19,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903291457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:19,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:19,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:19,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178552341] [2025-03-04 01:04:19,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:19,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:19,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:19,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:19,626 INFO L87 Difference]: Start difference. First operand 1215 states and 1462 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:19,802 INFO L93 Difference]: Finished difference Result 2525 states and 3039 transitions. [2025-03-04 01:04:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:19,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-03-04 01:04:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:19,808 INFO L225 Difference]: With dead ends: 2525 [2025-03-04 01:04:19,808 INFO L226 Difference]: Without dead ends: 1313 [2025-03-04 01:04:19,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:19,812 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 82 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:19,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 591 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2025-03-04 01:04:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1257. [2025-03-04 01:04:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1094 states have (on average 1.1718464351005484) internal successors, (1282), 1104 states have internal predecessors, (1282), 114 states have call successors, (114), 48 states have call predecessors, (114), 48 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-04 01:04:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1510 transitions. [2025-03-04 01:04:19,926 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1510 transitions. Word has length 141 [2025-03-04 01:04:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:19,926 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1510 transitions. [2025-03-04 01:04:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1510 transitions. [2025-03-04 01:04:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:04:19,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:19,929 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:19,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:04:19,929 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:19,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1047459075, now seen corresponding path program 1 times [2025-03-04 01:04:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182014503] [2025-03-04 01:04:19,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:19,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:04:19,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:04:19,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:19,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:20,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:20,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182014503] [2025-03-04 01:04:20,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182014503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:20,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:20,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:20,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566897004] [2025-03-04 01:04:20,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:20,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:20,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:20,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:20,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:20,118 INFO L87 Difference]: Start difference. First operand 1257 states and 1510 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:20,228 INFO L93 Difference]: Finished difference Result 2231 states and 2678 transitions. [2025-03-04 01:04:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:20,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2025-03-04 01:04:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:20,232 INFO L225 Difference]: With dead ends: 2231 [2025-03-04 01:04:20,232 INFO L226 Difference]: Without dead ends: 977 [2025-03-04 01:04:20,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:20,235 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 61 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:20,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 555 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-04 01:04:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 975. [2025-03-04 01:04:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 832 states have (on average 1.1514423076923077) internal successors, (958), 840 states have internal predecessors, (958), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:04:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1158 transitions. [2025-03-04 01:04:20,297 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1158 transitions. Word has length 142 [2025-03-04 01:04:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:20,297 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1158 transitions. [2025-03-04 01:04:20,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1158 transitions. [2025-03-04 01:04:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:04:20,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:20,299 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:20,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:04:20,299 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:20,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1856817941, now seen corresponding path program 1 times [2025-03-04 01:04:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662986417] [2025-03-04 01:04:20,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:20,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:04:20,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:04:20,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:20,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:20,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662986417] [2025-03-04 01:04:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662986417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:20,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811447901] [2025-03-04 01:04:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:20,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:20,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:20,756 INFO L87 Difference]: Start difference. First operand 975 states and 1158 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:21,022 INFO L93 Difference]: Finished difference Result 2076 states and 2456 transitions. [2025-03-04 01:04:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-03-04 01:04:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:21,027 INFO L225 Difference]: With dead ends: 2076 [2025-03-04 01:04:21,027 INFO L226 Difference]: Without dead ends: 1137 [2025-03-04 01:04:21,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:21,029 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:21,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 417 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-04 01:04:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 939. [2025-03-04 01:04:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 796 states have (on average 1.1256281407035176) internal successors, (896), 804 states have internal predecessors, (896), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:04:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1096 transitions. [2025-03-04 01:04:21,100 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1096 transitions. Word has length 142 [2025-03-04 01:04:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:21,101 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1096 transitions. [2025-03-04 01:04:21,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:04:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1096 transitions. [2025-03-04 01:04:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:04:21,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:21,102 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:21,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:04:21,103 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:21,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1260513912, now seen corresponding path program 1 times [2025-03-04 01:04:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815486849] [2025-03-04 01:04:21,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:21,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:04:21,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:04:21,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:21,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815486849] [2025-03-04 01:04:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815486849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528603922] [2025-03-04 01:04:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:21,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:21,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:21,260 INFO L87 Difference]: Start difference. First operand 939 states and 1096 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:21,379 INFO L93 Difference]: Finished difference Result 1773 states and 2069 transitions. [2025-03-04 01:04:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-03-04 01:04:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:21,383 INFO L225 Difference]: With dead ends: 1773 [2025-03-04 01:04:21,383 INFO L226 Difference]: Without dead ends: 870 [2025-03-04 01:04:21,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:21,385 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 122 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:21,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 575 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-04 01:04:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 864. [2025-03-04 01:04:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 721 states have (on average 1.116504854368932) internal successors, (805), 729 states have internal predecessors, (805), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:04:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1005 transitions. [2025-03-04 01:04:21,444 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1005 transitions. Word has length 143 [2025-03-04 01:04:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:21,445 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1005 transitions. [2025-03-04 01:04:21,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1005 transitions. [2025-03-04 01:04:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:04:21,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:21,447 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:21,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:04:21,448 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:21,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1481983929, now seen corresponding path program 1 times [2025-03-04 01:04:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:21,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989854595] [2025-03-04 01:04:21,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:21,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:04:21,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:04:21,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:21,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989854595] [2025-03-04 01:04:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989854595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:21,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:21,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:21,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938527812] [2025-03-04 01:04:21,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:21,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:21,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:21,635 INFO L87 Difference]: Start difference. First operand 864 states and 1005 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:21,753 INFO L93 Difference]: Finished difference Result 1650 states and 1910 transitions. [2025-03-04 01:04:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2025-03-04 01:04:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:21,756 INFO L225 Difference]: With dead ends: 1650 [2025-03-04 01:04:21,756 INFO L226 Difference]: Without dead ends: 822 [2025-03-04 01:04:21,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:21,759 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 35 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:21,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 543 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-04 01:04:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2025-03-04 01:04:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 679 states have (on average 1.0883652430044182) internal successors, (739), 687 states have internal predecessors, (739), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:04:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 939 transitions. [2025-03-04 01:04:21,819 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 939 transitions. Word has length 144 [2025-03-04 01:04:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:21,819 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 939 transitions. [2025-03-04 01:04:21,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:04:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 939 transitions. [2025-03-04 01:04:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:04:21,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:21,821 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:21,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:04:21,821 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -987036794, now seen corresponding path program 1 times [2025-03-04 01:04:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342507294] [2025-03-04 01:04:21,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:21,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:04:21,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:04:21,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:21,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:04:22,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:22,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342507294] [2025-03-04 01:04:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342507294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:22,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:04:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072592415] [2025-03-04 01:04:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:22,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:04:22,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:22,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:04:22,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:04:22,417 INFO L87 Difference]: Start difference. First operand 822 states and 939 transitions. Second operand has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:04:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:22,745 INFO L93 Difference]: Finished difference Result 1067 states and 1213 transitions. [2025-03-04 01:04:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:04:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 144 [2025-03-04 01:04:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:22,753 INFO L225 Difference]: With dead ends: 1067 [2025-03-04 01:04:22,754 INFO L226 Difference]: Without dead ends: 1065 [2025-03-04 01:04:22,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:04:22,755 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 64 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:22,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1404 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-03-04 01:04:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1061. [2025-03-04 01:04:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 874 states have (on average 1.0823798627002288) internal successors, (946), 885 states have internal predecessors, (946), 130 states have call successors, (130), 56 states have call predecessors, (130), 56 states have return successors, (130), 119 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:04:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1206 transitions. [2025-03-04 01:04:22,843 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1206 transitions. Word has length 144 [2025-03-04 01:04:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:22,844 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1206 transitions. [2025-03-04 01:04:22,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:04:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1206 transitions. [2025-03-04 01:04:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:04:22,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:22,845 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:22,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:04:22,846 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:22,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:22,846 INFO L85 PathProgramCache]: Analyzing trace with hash -99533113, now seen corresponding path program 1 times [2025-03-04 01:04:22,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:22,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684319119] [2025-03-04 01:04:22,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:22,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:22,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:04:22,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:04:22,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat