./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.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 5997605399232d6623d2d70739affa04a63a65f78c1dd829a070c5dea4fb22a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:26:56,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:26:56,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:26:56,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:26:56,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:26:56,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:26:56,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:26:56,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:26:56,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:26:56,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:26:56,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:26:56,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:26:56,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:26:56,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:26:56,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:26:56,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:26:56,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:26:56,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:26:56,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:26:56,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:26:56,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:26:56,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:26:56,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:26:56,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:26:56,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:26:56,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:26:56,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:26:56,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:26:56,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:26:56,784 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 -> 5997605399232d6623d2d70739affa04a63a65f78c1dd829a070c5dea4fb22a3 [2025-03-08 16:26:57,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:26:57,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:26:57,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:26:57,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:26:57,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:26:57,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i [2025-03-08 16:26:58,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a8dc759/9d1a2f4d6e37479b809a055ab8429fb8/FLAGc6245a8c0 [2025-03-08 16:26:58,439 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:26:58,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i [2025-03-08 16:26:58,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a8dc759/9d1a2f4d6e37479b809a055ab8429fb8/FLAGc6245a8c0 [2025-03-08 16:26:58,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a8dc759/9d1a2f4d6e37479b809a055ab8429fb8 [2025-03-08 16:26:58,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:26:58,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:26:58,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:26:58,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:26:58,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:26:58,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b209121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58, skipping insertion in model container [2025-03-08 16:26:58,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:26:58,578 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-ap_file-32.i[917,930] [2025-03-08 16:26:58,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:26:58,633 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:26:58,641 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-ap_file-32.i[917,930] [2025-03-08 16:26:58,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:26:58,695 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:26:58,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58 WrapperNode [2025-03-08 16:26:58,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:26:58,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:26:58,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:26:58,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:26:58,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,744 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-03-08 16:26:58,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:26:58,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:26:58,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:26:58,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:26:58,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,777 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 14, 23, 8, 24, 53]. 43 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 3, 1, 2, 4]. The 15 writes are split as follows [0, 2, 5, 2, 2, 4]. [2025-03-08 16:26:58,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:26:58,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:26:58,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:26:58,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:26:58,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (1/1) ... [2025-03-08 16:26:58,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:26:58,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:26:58,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:26:58,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:26:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:26:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:26:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:26:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:26:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:26:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:26:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:26:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:26:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:26:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:26:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:26:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:26:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:26:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:26:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:26:58,948 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:26:58,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:26:59,254 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem75#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~ite96#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short98#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite123#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem105#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1; [2025-03-08 16:26:59,286 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-08 16:26:59,287 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:26:59,294 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:26:59,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:26:59,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:59 BoogieIcfgContainer [2025-03-08 16:26:59,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:26:59,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:26:59,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:26:59,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:26:59,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:26:58" (1/3) ... [2025-03-08 16:26:59,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8133a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:59, skipping insertion in model container [2025-03-08 16:26:59,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:58" (2/3) ... [2025-03-08 16:26:59,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8133a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:59, skipping insertion in model container [2025-03-08 16:26:59,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:59" (3/3) ... [2025-03-08 16:26:59,305 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-32.i [2025-03-08 16:26:59,317 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:26:59,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:26:59,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:26:59,370 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;@4f004cc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:26:59,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:26:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:26:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:26:59,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:59,385 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:59,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:59,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2105035164, now seen corresponding path program 1 times [2025-03-08 16:26:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410510421] [2025-03-08 16:26:59,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:59,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:59,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:26:59,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:26:59,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:59,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:26:59,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:59,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410510421] [2025-03-08 16:26:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410510421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:26:59,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904396911] [2025-03-08 16:26:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:59,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:26:59,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:26:59,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:26:59,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:26:59,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:26:59,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:26:59,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:59,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:59,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:26:59,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:26:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:26:59,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:26:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904396911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:59,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:26:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:26:59,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988394344] [2025-03-08 16:26:59,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:59,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:26:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:59,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:26:59,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:26:59,864 INFO L87 Difference]: Start difference. First operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:26:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:59,887 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-03-08 16:26:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:26:59,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-08 16:26:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:59,893 INFO L225 Difference]: With dead ends: 190 [2025-03-08 16:26:59,893 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 16:26:59,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:26:59,897 INFO L435 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:59,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 16:26:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 16:26:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:26:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-08 16:26:59,927 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-03-08 16:26:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:59,927 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-08 16:26:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:26:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-08 16:26:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:26:59,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:59,930 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:59,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:27:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:27:00,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:00,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1664571346, now seen corresponding path program 1 times [2025-03-08 16:27:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:00,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964788934] [2025-03-08 16:27:00,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:00,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:27:00,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:27:00,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:00,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964788934] [2025-03-08 16:27:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964788934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:27:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30241632] [2025-03-08 16:27:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:27:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:00,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:27:00,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:27:00,495 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:00,638 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-03-08 16:27:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:27:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-08 16:27:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:00,643 INFO L225 Difference]: With dead ends: 318 [2025-03-08 16:27:00,644 INFO L226 Difference]: Without dead ends: 226 [2025-03-08 16:27:00,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:00,645 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 213 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:00,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 368 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-08 16:27:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 193. [2025-03-08 16:27:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:27:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-03-08 16:27:00,667 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 129 [2025-03-08 16:27:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:00,667 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-03-08 16:27:00,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-03-08 16:27:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:27:00,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:00,674 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:00,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:27:00,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:00,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash -172875070, now seen corresponding path program 1 times [2025-03-08 16:27:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639960346] [2025-03-08 16:27:00,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:00,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:27:00,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:27:00,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:00,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:01,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:01,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639960346] [2025-03-08 16:27:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639960346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:01,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:27:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231345399] [2025-03-08 16:27:01,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:01,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:27:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:01,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:27:01,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:27:01,810 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:27:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:02,501 INFO L93 Difference]: Finished difference Result 543 states and 762 transitions. [2025-03-08 16:27:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:27:02,502 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-03-08 16:27:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:02,504 INFO L225 Difference]: With dead ends: 543 [2025-03-08 16:27:02,504 INFO L226 Difference]: Without dead ends: 353 [2025-03-08 16:27:02,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:27:02,505 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 215 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:02,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 900 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:27:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-08 16:27:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 349. [2025-03-08 16:27:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 284 states have (on average 1.2992957746478873) internal successors, (369), 286 states have internal predecessors, (369), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:27:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 489 transitions. [2025-03-08 16:27:02,541 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 489 transitions. Word has length 137 [2025-03-08 16:27:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:02,541 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 489 transitions. [2025-03-08 16:27:02,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:27:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 489 transitions. [2025-03-08 16:27:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:27:02,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:02,543 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:02,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:27:02,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -133359771, now seen corresponding path program 1 times [2025-03-08 16:27:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191993879] [2025-03-08 16:27:02,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:02,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:27:02,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:27:02,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:02,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191993879] [2025-03-08 16:27:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191993879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:04,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:04,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:27:04,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747481992] [2025-03-08 16:27:04,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:04,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:27:04,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:04,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:27:04,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:27:04,557 INFO L87 Difference]: Start difference. First operand 349 states and 489 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:06,459 INFO L93 Difference]: Finished difference Result 796 states and 1105 transitions. [2025-03-08 16:27:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:27:06,461 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-08 16:27:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:06,466 INFO L225 Difference]: With dead ends: 796 [2025-03-08 16:27:06,466 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 16:27:06,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:27:06,468 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 391 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:06,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1135 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:27:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 16:27:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 299. [2025-03-08 16:27:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 247 states have internal predecessors, (320), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:27:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 416 transitions. [2025-03-08 16:27:06,508 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 416 transitions. Word has length 139 [2025-03-08 16:27:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:06,509 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 416 transitions. [2025-03-08 16:27:06,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 416 transitions. [2025-03-08 16:27:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:27:06,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:06,511 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:06,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:27:06,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:06,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:06,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1917836731, now seen corresponding path program 1 times [2025-03-08 16:27:06,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:06,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042863343] [2025-03-08 16:27:06,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:06,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:06,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:27:06,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:27:06,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:06,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:08,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042863343] [2025-03-08 16:27:08,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042863343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:08,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:08,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:27:08,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972523479] [2025-03-08 16:27:08,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:08,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:27:08,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:08,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:27:08,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:27:08,064 INFO L87 Difference]: Start difference. First operand 299 states and 416 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:12,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:27:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:14,735 INFO L93 Difference]: Finished difference Result 714 states and 987 transitions. [2025-03-08 16:27:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:27:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-08 16:27:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:14,738 INFO L225 Difference]: With dead ends: 714 [2025-03-08 16:27:14,738 INFO L226 Difference]: Without dead ends: 418 [2025-03-08 16:27:14,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:27:14,740 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 579 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:14,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1237 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1173 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-03-08 16:27:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-08 16:27:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 304. [2025-03-08 16:27:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 251 states have (on average 1.294820717131474) internal successors, (325), 252 states have internal predecessors, (325), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:27:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 421 transitions. [2025-03-08 16:27:14,774 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 421 transitions. Word has length 139 [2025-03-08 16:27:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:14,774 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 421 transitions. [2025-03-08 16:27:14,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 421 transitions. [2025-03-08 16:27:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:27:14,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:14,776 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:14,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:27:14,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:14,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash -391010055, now seen corresponding path program 1 times [2025-03-08 16:27:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5801298] [2025-03-08 16:27:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:14,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:27:14,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:27:14,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:14,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:27:14,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:14,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5801298] [2025-03-08 16:27:14,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5801298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:14,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024985448] [2025-03-08 16:27:14,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:14,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:27:14,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:27:14,904 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-08 16:27:14,906 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-08 16:27:14,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:27:15,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:27:15,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:15,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:15,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:27:15,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:15,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:27:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024985448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:27:15,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:27:15,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484713439] [2025-03-08 16:27:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:15,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:15,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:15,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:27:15,057 INFO L87 Difference]: Start difference. First operand 304 states and 421 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:15,095 INFO L93 Difference]: Finished difference Result 614 states and 851 transitions. [2025-03-08 16:27:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:15,095 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-03-08 16:27:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:15,097 INFO L225 Difference]: With dead ends: 614 [2025-03-08 16:27:15,097 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 16:27:15,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:27:15,098 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:15,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 16:27:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-08 16:27:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 260 states have (on average 1.2846153846153847) internal successors, (334), 261 states have internal predecessors, (334), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:27:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 430 transitions. [2025-03-08 16:27:15,125 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 430 transitions. Word has length 139 [2025-03-08 16:27:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:15,125 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 430 transitions. [2025-03-08 16:27:15,125 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 430 transitions. [2025-03-08 16:27:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:27:15,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:15,127 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:15,133 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-08 16:27:15,327 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,SelfDestructingSolverStorable5 [2025-03-08 16:27:15,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:15,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash 7464510, now seen corresponding path program 1 times [2025-03-08 16:27:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264630629] [2025-03-08 16:27:15,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:15,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:27:15,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:27:15,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:15,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:17,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264630629] [2025-03-08 16:27:17,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264630629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:17,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 16:27:17,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014146126] [2025-03-08 16:27:17,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:17,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 16:27:17,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:17,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 16:27:17,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:27:17,074 INFO L87 Difference]: Start difference. First operand 313 states and 430 transitions. Second operand has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:27:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:21,122 INFO L93 Difference]: Finished difference Result 793 states and 1086 transitions. [2025-03-08 16:27:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 16:27:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 140 [2025-03-08 16:27:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:21,127 INFO L225 Difference]: With dead ends: 793 [2025-03-08 16:27:21,127 INFO L226 Difference]: Without dead ends: 620 [2025-03-08 16:27:21,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 16:27:21,130 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 702 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:21,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1594 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 16:27:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-08 16:27:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 328. [2025-03-08 16:27:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 275 states have (on average 1.298181818181818) internal successors, (357), 276 states have internal predecessors, (357), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:27:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 453 transitions. [2025-03-08 16:27:21,173 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 453 transitions. Word has length 140 [2025-03-08 16:27:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:21,173 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 453 transitions. [2025-03-08 16:27:21,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:27:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2025-03-08 16:27:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:27:21,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:21,174 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:21,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:27:21,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:21,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash -789425596, now seen corresponding path program 1 times [2025-03-08 16:27:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28380853] [2025-03-08 16:27:21,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:21,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:27:21,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:27:21,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:21,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:22,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28380853] [2025-03-08 16:27:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28380853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:27:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296669798] [2025-03-08 16:27:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:22,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:27:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:22,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:27:22,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:27:22,448 INFO L87 Difference]: Start difference. First operand 328 states and 453 transitions. Second operand has 18 states, 16 states have (on average 3.3125) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:24,988 INFO L93 Difference]: Finished difference Result 775 states and 1063 transitions. [2025-03-08 16:27:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:27:24,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.3125) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 140 [2025-03-08 16:27:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:24,992 INFO L225 Difference]: With dead ends: 775 [2025-03-08 16:27:24,992 INFO L226 Difference]: Without dead ends: 587 [2025-03-08 16:27:24,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:27:24,994 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 598 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:24,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1641 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 16:27:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-08 16:27:25,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 337. [2025-03-08 16:27:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 284 states have (on average 1.295774647887324) internal successors, (368), 285 states have internal predecessors, (368), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:27:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 464 transitions. [2025-03-08 16:27:25,048 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 464 transitions. Word has length 140 [2025-03-08 16:27:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:25,048 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 464 transitions. [2025-03-08 16:27:25,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.3125) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 464 transitions. [2025-03-08 16:27:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:27:25,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:25,049 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:25,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:27:25,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:25,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1696627240, now seen corresponding path program 1 times [2025-03-08 16:27:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:25,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156023149] [2025-03-08 16:27:25,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:25,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:27:25,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:27:25,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:25,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:26,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:26,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156023149] [2025-03-08 16:27:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156023149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:26,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:26,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 16:27:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775144384] [2025-03-08 16:27:26,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:26,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:27:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:26,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:27:26,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:27:26,174 INFO L87 Difference]: Start difference. First operand 337 states and 464 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:28,601 INFO L93 Difference]: Finished difference Result 935 states and 1280 transitions. [2025-03-08 16:27:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 16:27:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2025-03-08 16:27:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:28,604 INFO L225 Difference]: With dead ends: 935 [2025-03-08 16:27:28,604 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 16:27:28,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 16:27:28,605 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 318 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:28,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 2472 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 16:27:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 16:27:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 363. [2025-03-08 16:27:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 310 states have (on average 1.3) internal successors, (403), 311 states have internal predecessors, (403), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:27:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 499 transitions. [2025-03-08 16:27:28,644 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 499 transitions. Word has length 141 [2025-03-08 16:27:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:28,644 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 499 transitions. [2025-03-08 16:27:28,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 499 transitions. [2025-03-08 16:27:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:27:28,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:28,645 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:28,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:27:28,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:28,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 189013819, now seen corresponding path program 1 times [2025-03-08 16:27:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856670418] [2025-03-08 16:27:28,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:28,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:27:28,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:27:28,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:28,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:28,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:28,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856670418] [2025-03-08 16:27:28,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856670418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:28,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:28,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:27:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435473197] [2025-03-08 16:27:28,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:28,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:27:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:28,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:27:28,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:27:28,924 INFO L87 Difference]: Start difference. First operand 363 states and 499 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:29,326 INFO L93 Difference]: Finished difference Result 972 states and 1325 transitions. [2025-03-08 16:27:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:27:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-08 16:27:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:29,329 INFO L225 Difference]: With dead ends: 972 [2025-03-08 16:27:29,329 INFO L226 Difference]: Without dead ends: 612 [2025-03-08 16:27:29,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:27:29,330 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 217 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:29,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 512 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:27:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-08 16:27:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 484. [2025-03-08 16:27:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 413 states have (on average 1.2857142857142858) internal successors, (531), 416 states have internal predecessors, (531), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:27:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 659 transitions. [2025-03-08 16:27:29,388 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 659 transitions. Word has length 141 [2025-03-08 16:27:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:29,389 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 659 transitions. [2025-03-08 16:27:29,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 659 transitions. [2025-03-08 16:27:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:27:29,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:29,390 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:29,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:27:29,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:29,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1656351597, now seen corresponding path program 1 times [2025-03-08 16:27:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809230913] [2025-03-08 16:27:29,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:29,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:27:29,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:27:29,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:29,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:27:30,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809230913] [2025-03-08 16:27:30,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809230913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509163901] [2025-03-08 16:27:30,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:30,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:27:30,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:27:30,038 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-08 16:27:30,040 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-08 16:27:30,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:27:30,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:27:30,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:30,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:27:30,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:30,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:27:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:30,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:27:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509163901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:30,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:27:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 23 [2025-03-08 16:27:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823687433] [2025-03-08 16:27:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:30,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:27:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:30,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:27:30,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:27:30,400 INFO L87 Difference]: Start difference. First operand 484 states and 659 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:30,686 INFO L93 Difference]: Finished difference Result 756 states and 999 transitions. [2025-03-08 16:27:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:27:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-08 16:27:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:30,690 INFO L225 Difference]: With dead ends: 756 [2025-03-08 16:27:30,690 INFO L226 Difference]: Without dead ends: 754 [2025-03-08 16:27:30,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:27:30,691 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 53 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:30,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1030 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:27:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-08 16:27:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 747. [2025-03-08 16:27:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 651 states have (on average 1.2580645161290323) internal successors, (819), 659 states have internal predecessors, (819), 84 states have call successors, (84), 11 states have call predecessors, (84), 11 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:27:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 987 transitions. [2025-03-08 16:27:30,785 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 987 transitions. Word has length 141 [2025-03-08 16:27:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:30,786 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 987 transitions. [2025-03-08 16:27:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 987 transitions. [2025-03-08 16:27:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:27:30,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:30,789 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:30,796 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-08 16:27:30,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:27:30,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:30,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1270623358, now seen corresponding path program 1 times [2025-03-08 16:27:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167941808] [2025-03-08 16:27:30,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:31,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:27:31,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:27:31,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:31,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:32,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167941808] [2025-03-08 16:27:32,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167941808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:32,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:32,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 16:27:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210831201] [2025-03-08 16:27:32,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:32,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:27:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:32,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:27:32,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:27:32,903 INFO L87 Difference]: Start difference. First operand 747 states and 987 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:36,426 INFO L93 Difference]: Finished difference Result 1628 states and 2146 transitions. [2025-03-08 16:27:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:27:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2025-03-08 16:27:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:36,430 INFO L225 Difference]: With dead ends: 1628 [2025-03-08 16:27:36,430 INFO L226 Difference]: Without dead ends: 884 [2025-03-08 16:27:36,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:27:36,432 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 403 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:36,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1511 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 16:27:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-08 16:27:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 773. [2025-03-08 16:27:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 663 states have (on average 1.248868778280543) internal successors, (828), 672 states have internal predecessors, (828), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:27:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1020 transitions. [2025-03-08 16:27:36,549 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1020 transitions. Word has length 141 [2025-03-08 16:27:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:36,550 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1020 transitions. [2025-03-08 16:27:36,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1020 transitions. [2025-03-08 16:27:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:27:36,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:36,551 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:27:36,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -410192191, now seen corresponding path program 1 times [2025-03-08 16:27:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055133626] [2025-03-08 16:27:36,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:36,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:36,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:27:36,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:27:36,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:37,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055133626] [2025-03-08 16:27:37,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055133626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:37,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 16:27:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818195041] [2025-03-08 16:27:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:37,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 16:27:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:37,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 16:27:37,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:27:37,509 INFO L87 Difference]: Start difference. First operand 773 states and 1020 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:39,197 INFO L93 Difference]: Finished difference Result 1745 states and 2298 transitions. [2025-03-08 16:27:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:27:39,197 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-03-08 16:27:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:39,200 INFO L225 Difference]: With dead ends: 1745 [2025-03-08 16:27:39,200 INFO L226 Difference]: Without dead ends: 996 [2025-03-08 16:27:39,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 16:27:39,203 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 319 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:39,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1823 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:27:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-08 16:27:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 736. [2025-03-08 16:27:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 626 states have (on average 1.2460063897763578) internal successors, (780), 635 states have internal predecessors, (780), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:27:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 972 transitions. [2025-03-08 16:27:39,318 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 972 transitions. Word has length 142 [2025-03-08 16:27:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:39,318 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 972 transitions. [2025-03-08 16:27:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 972 transitions. [2025-03-08 16:27:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:27:39,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:39,319 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:39,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:27:39,320 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2034611334, now seen corresponding path program 1 times [2025-03-08 16:27:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818451673] [2025-03-08 16:27:39,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:39,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:27:39,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:27:39,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:39,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:39,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818451673] [2025-03-08 16:27:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818451673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:39,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:39,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:27:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542343201] [2025-03-08 16:27:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:27:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:39,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:27:39,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:27:39,535 INFO L87 Difference]: Start difference. First operand 736 states and 972 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:39,771 INFO L93 Difference]: Finished difference Result 1436 states and 1903 transitions. [2025-03-08 16:27:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:27:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-08 16:27:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:39,774 INFO L225 Difference]: With dead ends: 1436 [2025-03-08 16:27:39,774 INFO L226 Difference]: Without dead ends: 1021 [2025-03-08 16:27:39,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-08 16:27:39,776 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 74 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:39,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 990 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-08 16:27:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 933. [2025-03-08 16:27:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 809 states have (on average 1.2595797280593326) internal successors, (1019), 820 states have internal predecessors, (1019), 108 states have call successors, (108), 15 states have call predecessors, (108), 15 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 16:27:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1235 transitions. [2025-03-08 16:27:39,908 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1235 transitions. Word has length 142 [2025-03-08 16:27:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:39,908 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1235 transitions. [2025-03-08 16:27:39,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1235 transitions. [2025-03-08 16:27:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:27:39,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:39,911 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:39,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:27:39,911 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:39,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash 800718785, now seen corresponding path program 1 times [2025-03-08 16:27:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:39,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688733850] [2025-03-08 16:27:39,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:39,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:27:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:27:40,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:40,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:40,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688733850] [2025-03-08 16:27:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688733850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:27:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117070361] [2025-03-08 16:27:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:40,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:27:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:40,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:27:40,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:27:40,977 INFO L87 Difference]: Start difference. First operand 933 states and 1235 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:42,283 INFO L93 Difference]: Finished difference Result 2104 states and 2786 transitions. [2025-03-08 16:27:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:27:42,284 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-03-08 16:27:42,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:42,288 INFO L225 Difference]: With dead ends: 2104 [2025-03-08 16:27:42,288 INFO L226 Difference]: Without dead ends: 1195 [2025-03-08 16:27:42,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:27:42,289 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 290 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:42,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 787 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:27:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-03-08 16:27:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 896. [2025-03-08 16:27:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 772 states have (on average 1.2538860103626943) internal successors, (968), 783 states have internal predecessors, (968), 108 states have call successors, (108), 15 states have call predecessors, (108), 15 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 16:27:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1184 transitions. [2025-03-08 16:27:42,413 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1184 transitions. Word has length 142 [2025-03-08 16:27:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:42,413 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1184 transitions. [2025-03-08 16:27:42,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1184 transitions. [2025-03-08 16:27:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:27:42,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:42,414 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:42,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:27:42,415 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:42,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1598453992, now seen corresponding path program 1 times [2025-03-08 16:27:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292534137] [2025-03-08 16:27:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:42,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:27:42,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:27:42,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:42,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:42,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292534137] [2025-03-08 16:27:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292534137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297354399] [2025-03-08 16:27:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:42,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:42,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:42,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:42,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:42,516 INFO L87 Difference]: Start difference. First operand 896 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:42,684 INFO L93 Difference]: Finished difference Result 2014 states and 2656 transitions. [2025-03-08 16:27:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:42,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-08 16:27:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:42,688 INFO L225 Difference]: With dead ends: 2014 [2025-03-08 16:27:42,688 INFO L226 Difference]: Without dead ends: 1142 [2025-03-08 16:27:42,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:42,689 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 46 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:42,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 626 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-08 16:27:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 990. [2025-03-08 16:27:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 866 states have (on average 1.25635103926097) internal successors, (1088), 877 states have internal predecessors, (1088), 108 states have call successors, (108), 15 states have call predecessors, (108), 15 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 16:27:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1304 transitions. [2025-03-08 16:27:42,813 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1304 transitions. Word has length 143 [2025-03-08 16:27:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:42,814 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1304 transitions. [2025-03-08 16:27:42,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1304 transitions. [2025-03-08 16:27:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:27:42,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:42,815 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:42,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:27:42,815 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 858145130, now seen corresponding path program 1 times [2025-03-08 16:27:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:42,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194423393] [2025-03-08 16:27:42,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:42,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:42,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:27:42,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:27:42,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:42,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:43,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194423393] [2025-03-08 16:27:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194423393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:27:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884435433] [2025-03-08 16:27:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:43,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:27:43,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:43,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:27:43,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:27:43,716 INFO L87 Difference]: Start difference. First operand 990 states and 1304 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:27:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:45,394 INFO L93 Difference]: Finished difference Result 2192 states and 2877 transitions. [2025-03-08 16:27:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:27:45,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2025-03-08 16:27:45,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:45,398 INFO L225 Difference]: With dead ends: 2192 [2025-03-08 16:27:45,398 INFO L226 Difference]: Without dead ends: 1226 [2025-03-08 16:27:45,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:27:45,400 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 253 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:45,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1556 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 16:27:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-08 16:27:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1002. [2025-03-08 16:27:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 887 states have (on average 1.2536640360766629) internal successors, (1112), 897 states have internal predecessors, (1112), 100 states have call successors, (100), 14 states have call predecessors, (100), 14 states have return successors, (100), 90 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 16:27:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1312 transitions. [2025-03-08 16:27:45,532 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1312 transitions. Word has length 143 [2025-03-08 16:27:45,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:45,532 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1312 transitions. [2025-03-08 16:27:45,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:27:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1312 transitions. [2025-03-08 16:27:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:27:45,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:45,534 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:45,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:27:45,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash 44770301, now seen corresponding path program 1 times [2025-03-08 16:27:45,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:45,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129420784] [2025-03-08 16:27:45,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:45,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:45,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:27:45,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:27:45,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:45,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129420784] [2025-03-08 16:27:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129420784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:45,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:45,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996522579] [2025-03-08 16:27:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:45,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:45,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:45,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:45,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:45,677 INFO L87 Difference]: Start difference. First operand 1002 states and 1312 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:45,854 INFO L93 Difference]: Finished difference Result 1646 states and 2165 transitions. [2025-03-08 16:27:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-08 16:27:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:45,857 INFO L225 Difference]: With dead ends: 1646 [2025-03-08 16:27:45,858 INFO L226 Difference]: Without dead ends: 1022 [2025-03-08 16:27:45,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:45,859 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 40 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:45,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 614 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-03-08 16:27:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 982. [2025-03-08 16:27:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 867 states have (on average 1.2479815455594003) internal successors, (1082), 877 states have internal predecessors, (1082), 100 states have call successors, (100), 14 states have call predecessors, (100), 14 states have return successors, (100), 90 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 16:27:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1282 transitions. [2025-03-08 16:27:45,982 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1282 transitions. Word has length 144 [2025-03-08 16:27:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1282 transitions. [2025-03-08 16:27:45,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1282 transitions. [2025-03-08 16:27:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:27:45,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:45,984 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:27:45,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1446880791, now seen corresponding path program 1 times [2025-03-08 16:27:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434005066] [2025-03-08 16:27:45,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:45,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:27:46,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:27:46,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:46,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:46,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434005066] [2025-03-08 16:27:46,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434005066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:46,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:46,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:27:46,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589161618] [2025-03-08 16:27:46,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:46,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:27:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:46,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:27:46,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:27:46,548 INFO L87 Difference]: Start difference. First operand 982 states and 1282 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:27:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:47,614 INFO L93 Difference]: Finished difference Result 2533 states and 3305 transitions. [2025-03-08 16:27:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:27:47,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-03-08 16:27:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:47,619 INFO L225 Difference]: With dead ends: 2533 [2025-03-08 16:27:47,619 INFO L226 Difference]: Without dead ends: 1554 [2025-03-08 16:27:47,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:27:47,621 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 230 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:47,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1033 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:27:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-08 16:27:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1073. [2025-03-08 16:27:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 944 states have (on average 1.2372881355932204) internal successors, (1168), 956 states have internal predecessors, (1168), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 100 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 16:27:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1392 transitions. [2025-03-08 16:27:47,784 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1392 transitions. Word has length 144 [2025-03-08 16:27:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:47,785 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1392 transitions. [2025-03-08 16:27:47,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:27:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1392 transitions. [2025-03-08 16:27:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:27:47,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:47,786 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:47,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:27:47,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:47,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2050012873, now seen corresponding path program 1 times [2025-03-08 16:27:47,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:47,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625931373] [2025-03-08 16:27:47,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:47,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:27:47,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:27:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:48,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:48,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625931373] [2025-03-08 16:27:48,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625931373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:48,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:48,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:27:48,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824404548] [2025-03-08 16:27:48,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:48,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:27:48,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:48,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:27:48,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:27:48,444 INFO L87 Difference]: Start difference. First operand 1073 states and 1392 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:27:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:49,297 INFO L93 Difference]: Finished difference Result 2267 states and 2940 transitions. [2025-03-08 16:27:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:27:49,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-03-08 16:27:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:49,302 INFO L225 Difference]: With dead ends: 2267 [2025-03-08 16:27:49,302 INFO L226 Difference]: Without dead ends: 1197 [2025-03-08 16:27:49,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:27:49,303 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 227 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:49,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 680 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:27:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2025-03-08 16:27:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1046. [2025-03-08 16:27:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 892 states have (on average 1.2253363228699552) internal successors, (1093), 902 states have internal predecessors, (1093), 132 states have call successors, (132), 21 states have call predecessors, (132), 21 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 16:27:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1357 transitions. [2025-03-08 16:27:49,506 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1357 transitions. Word has length 144 [2025-03-08 16:27:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:49,506 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1357 transitions. [2025-03-08 16:27:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:27:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1357 transitions. [2025-03-08 16:27:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:27:49,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:49,508 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:49,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:27:49,508 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:49,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash -481537119, now seen corresponding path program 1 times [2025-03-08 16:27:49,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:49,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128320569] [2025-03-08 16:27:49,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:49,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:27:49,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:27:49,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:49,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128320569] [2025-03-08 16:27:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128320569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779504337] [2025-03-08 16:27:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:49,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:49,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:49,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:49,691 INFO L87 Difference]: Start difference. First operand 1046 states and 1357 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:50,144 INFO L93 Difference]: Finished difference Result 2165 states and 2790 transitions. [2025-03-08 16:27:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:50,145 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:27:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:50,148 INFO L225 Difference]: With dead ends: 2165 [2025-03-08 16:27:50,148 INFO L226 Difference]: Without dead ends: 1122 [2025-03-08 16:27:50,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:50,150 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:50,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 377 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:27:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-08 16:27:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 701. [2025-03-08 16:27:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 624 states have (on average 1.2387820512820513) internal successors, (773), 627 states have internal predecessors, (773), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:27:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 901 transitions. [2025-03-08 16:27:50,255 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 901 transitions. Word has length 145 [2025-03-08 16:27:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:50,255 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 901 transitions. [2025-03-08 16:27:50,255 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 901 transitions. [2025-03-08 16:27:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:27:50,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:50,257 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:50,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:27:50,257 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:50,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1714819045, now seen corresponding path program 1 times [2025-03-08 16:27:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:50,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230327011] [2025-03-08 16:27:50,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:50,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:50,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:27:50,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:27:50,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:50,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230327011] [2025-03-08 16:27:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230327011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:27:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068741445] [2025-03-08 16:27:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:50,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:27:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:50,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:27:50,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:27:50,478 INFO L87 Difference]: Start difference. First operand 701 states and 901 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:50,769 INFO L93 Difference]: Finished difference Result 1650 states and 2117 transitions. [2025-03-08 16:27:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:27:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:27:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:50,773 INFO L225 Difference]: With dead ends: 1650 [2025-03-08 16:27:50,773 INFO L226 Difference]: Without dead ends: 952 [2025-03-08 16:27:50,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:27:50,777 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 69 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1193 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:50,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1193 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-03-08 16:27:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 787. [2025-03-08 16:27:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 710 states have (on average 1.2450704225352112) internal successors, (884), 713 states have internal predecessors, (884), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:27:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1012 transitions. [2025-03-08 16:27:50,883 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1012 transitions. Word has length 145 [2025-03-08 16:27:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:50,883 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1012 transitions. [2025-03-08 16:27:50,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1012 transitions. [2025-03-08 16:27:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:27:50,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:50,884 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:50,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:27:50,884 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:50,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash -470054564, now seen corresponding path program 1 times [2025-03-08 16:27:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:50,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457409294] [2025-03-08 16:27:50,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:50,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:50,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:27:50,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:27:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:50,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457409294] [2025-03-08 16:27:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457409294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918013895] [2025-03-08 16:27:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:50,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:50,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:50,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:50,979 INFO L87 Difference]: Start difference. First operand 787 states and 1012 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:51,151 INFO L93 Difference]: Finished difference Result 1659 states and 2130 transitions. [2025-03-08 16:27:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:51,152 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:27:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:51,155 INFO L225 Difference]: With dead ends: 1659 [2025-03-08 16:27:51,156 INFO L226 Difference]: Without dead ends: 875 [2025-03-08 16:27:51,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:51,157 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 42 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:51,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 617 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-08 16:27:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 766. [2025-03-08 16:27:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 689 states have (on average 1.2409288824383164) internal successors, (855), 692 states have internal predecessors, (855), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:27:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 983 transitions. [2025-03-08 16:27:51,259 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 983 transitions. Word has length 145 [2025-03-08 16:27:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:51,260 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 983 transitions. [2025-03-08 16:27:51,260 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 983 transitions. [2025-03-08 16:27:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:27:51,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:51,261 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:51,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:27:51,261 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash 773801681, now seen corresponding path program 1 times [2025-03-08 16:27:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407910233] [2025-03-08 16:27:51,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:51,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:51,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:27:51,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:27:51,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:51,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:51,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:51,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407910233] [2025-03-08 16:27:51,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407910233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:51,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:51,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752559521] [2025-03-08 16:27:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:51,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:51,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:51,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:51,405 INFO L87 Difference]: Start difference. First operand 766 states and 983 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:51,811 INFO L93 Difference]: Finished difference Result 1534 states and 1961 transitions. [2025-03-08 16:27:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:51,811 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:27:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:51,814 INFO L225 Difference]: With dead ends: 1534 [2025-03-08 16:27:51,814 INFO L226 Difference]: Without dead ends: 771 [2025-03-08 16:27:51,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:51,816 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 62 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:51,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 471 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:27:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-08 16:27:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 678. [2025-03-08 16:27:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 615 states have (on average 1.245528455284553) internal successors, (766), 617 states have internal predecessors, (766), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:27:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 870 transitions. [2025-03-08 16:27:51,916 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 870 transitions. Word has length 145 [2025-03-08 16:27:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:51,916 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 870 transitions. [2025-03-08 16:27:51,916 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 870 transitions. [2025-03-08 16:27:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:27:51,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:51,917 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:51,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:27:51,917 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:51,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1538894258, now seen corresponding path program 1 times [2025-03-08 16:27:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012694743] [2025-03-08 16:27:51,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:51,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:27:51,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:27:51,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:51,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:53,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:53,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012694743] [2025-03-08 16:27:53,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012694743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:53,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:53,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 16:27:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083606787] [2025-03-08 16:27:53,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:53,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 16:27:53,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:53,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 16:27:53,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:27:53,308 INFO L87 Difference]: Start difference. First operand 678 states and 870 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:57,499 INFO L93 Difference]: Finished difference Result 1714 states and 2090 transitions. [2025-03-08 16:27:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 16:27:57,500 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-08 16:27:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:57,504 INFO L225 Difference]: With dead ends: 1714 [2025-03-08 16:27:57,504 INFO L226 Difference]: Without dead ends: 1712 [2025-03-08 16:27:57,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=706, Invalid=4550, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 16:27:57,505 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 851 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:57,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1588 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:27:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-03-08 16:27:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1202. [2025-03-08 16:27:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1091 states have (on average 1.1934005499541704) internal successors, (1302), 1097 states have internal predecessors, (1302), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 16:27:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1486 transitions. [2025-03-08 16:27:57,695 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1486 transitions. Word has length 147 [2025-03-08 16:27:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:57,695 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1486 transitions. [2025-03-08 16:27:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:27:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1486 transitions. [2025-03-08 16:27:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:27:57,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:57,697 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:57,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:27:57,697 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1752543954, now seen corresponding path program 1 times [2025-03-08 16:27:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853580629] [2025-03-08 16:27:57,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:57,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:27:57,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:27:57,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:57,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853580629] [2025-03-08 16:27:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853580629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:58,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:58,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:27:58,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124024106] [2025-03-08 16:27:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:58,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:27:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:58,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:27:58,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:27:58,067 INFO L87 Difference]: Start difference. First operand 1202 states and 1486 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:59,092 INFO L93 Difference]: Finished difference Result 3237 states and 3964 transitions. [2025-03-08 16:27:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:27:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:27:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:59,098 INFO L225 Difference]: With dead ends: 3237 [2025-03-08 16:27:59,098 INFO L226 Difference]: Without dead ends: 2038 [2025-03-08 16:27:59,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:27:59,100 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 303 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:59,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 685 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:27:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2025-03-08 16:27:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1238. [2025-03-08 16:27:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1127 states have (on average 1.1872227151730257) internal successors, (1338), 1133 states have internal predecessors, (1338), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 16:27:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1522 transitions. [2025-03-08 16:27:59,319 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1522 transitions. Word has length 147 [2025-03-08 16:27:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:59,319 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1522 transitions. [2025-03-08 16:27:59,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1522 transitions. [2025-03-08 16:27:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:27:59,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:59,321 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:59,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:27:59,321 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:59,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash -294129777, now seen corresponding path program 1 times [2025-03-08 16:27:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486775933] [2025-03-08 16:27:59,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:59,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:59,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:27:59,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:27:59,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:59,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:27:59,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:59,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486775933] [2025-03-08 16:27:59,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486775933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:59,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:59,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:59,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809599778] [2025-03-08 16:27:59,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:59,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:59,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:59,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:59,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:59,410 INFO L87 Difference]: Start difference. First operand 1238 states and 1522 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:59,644 INFO L93 Difference]: Finished difference Result 2473 states and 3040 transitions. [2025-03-08 16:27:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:59,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:27:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:59,648 INFO L225 Difference]: With dead ends: 2473 [2025-03-08 16:27:59,649 INFO L226 Difference]: Without dead ends: 1238 [2025-03-08 16:27:59,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:59,650 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 31 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:59,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 593 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2025-03-08 16:27:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1236. [2025-03-08 16:27:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1125 states have (on average 1.1857777777777778) internal successors, (1334), 1131 states have internal predecessors, (1334), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 16:27:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1518 transitions. [2025-03-08 16:27:59,848 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1518 transitions. Word has length 147 [2025-03-08 16:27:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:59,848 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1518 transitions. [2025-03-08 16:27:59,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:27:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1518 transitions. [2025-03-08 16:27:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:27:59,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:59,849 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:59,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:27:59,850 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:59,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash -867630035, now seen corresponding path program 1 times [2025-03-08 16:27:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22311925] [2025-03-08 16:27:59,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:59,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:27:59,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:27:59,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:59,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:28:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:28:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:28:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22311925] [2025-03-08 16:28:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22311925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:28:00,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:28:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:28:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676302568] [2025-03-08 16:28:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:28:00,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:28:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:28:00,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:28:00,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:28:00,580 INFO L87 Difference]: Start difference. First operand 1236 states and 1518 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:28:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:28:02,003 INFO L93 Difference]: Finished difference Result 2684 states and 3284 transitions. [2025-03-08 16:28:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:28:02,003 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-03-08 16:28:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:28:02,008 INFO L225 Difference]: With dead ends: 2684 [2025-03-08 16:28:02,008 INFO L226 Difference]: Without dead ends: 1451 [2025-03-08 16:28:02,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:28:02,010 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 290 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:28:02,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1093 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:28:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2025-03-08 16:28:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1253. [2025-03-08 16:28:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1142 states have (on average 1.183012259194396) internal successors, (1351), 1148 states have internal predecessors, (1351), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 16:28:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1535 transitions. [2025-03-08 16:28:02,209 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1535 transitions. Word has length 148 [2025-03-08 16:28:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:28:02,209 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1535 transitions. [2025-03-08 16:28:02,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:28:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1535 transitions. [2025-03-08 16:28:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:28:02,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:28:02,210 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:28:02,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:28:02,210 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:28:02,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:28:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1871159119, now seen corresponding path program 1 times [2025-03-08 16:28:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:28:02,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391584336] [2025-03-08 16:28:02,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:28:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:28:02,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:28:02,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:28:02,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:28:02,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:28:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:28:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:28:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391584336] [2025-03-08 16:28:02,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391584336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:28:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135405157] [2025-03-08 16:28:02,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:28:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:28:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:28:02,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:28:02,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:28:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:28:02,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:28:02,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:28:02,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:28:02,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:28:02,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:28:02,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:28:02,771 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 27 treesize of output 11 [2025-03-08 16:28:02,867 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 15 treesize of output 7 [2025-03-08 16:28:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 29 proven. 291 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-08 16:28:02,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:28:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135405157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:28:03,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:28:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2025-03-08 16:28:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142745479] [2025-03-08 16:28:03,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:28:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:28:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:28:03,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:28:03,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:28:03,022 INFO L87 Difference]: Start difference. First operand 1253 states and 1535 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 16:28:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:28:03,552 INFO L93 Difference]: Finished difference Result 2563 states and 3120 transitions. [2025-03-08 16:28:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:28:03,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 148 [2025-03-08 16:28:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:28:03,557 INFO L225 Difference]: With dead ends: 2563 [2025-03-08 16:28:03,557 INFO L226 Difference]: Without dead ends: 1313 [2025-03-08 16:28:03,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:28:03,559 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 149 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:28:03,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 839 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:28:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2025-03-08 16:28:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1257. [2025-03-08 16:28:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1148 states have (on average 1.1646341463414633) internal successors, (1337), 1154 states have internal predecessors, (1337), 86 states have call successors, (86), 22 states have call predecessors, (86), 22 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 16:28:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1509 transitions. [2025-03-08 16:28:03,770 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1509 transitions. Word has length 148 [2025-03-08 16:28:03,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:28:03,770 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1509 transitions. [2025-03-08 16:28:03,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 16:28:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1509 transitions. [2025-03-08 16:28:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:28:03,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:28:03,772 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:28:03,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:28:03,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 16:28:03,973 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:28:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:28:03,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1938165872, now seen corresponding path program 1 times [2025-03-08 16:28:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:28:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185815951] [2025-03-08 16:28:03,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:28:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:28:03,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:28:04,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:28:04,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:28:04,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:28:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:28:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:28:05,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185815951] [2025-03-08 16:28:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185815951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:28:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:28:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 16:28:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623025569] [2025-03-08 16:28:05,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:28:05,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 16:28:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:28:05,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 16:28:05,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:28:05,870 INFO L87 Difference]: Start difference. First operand 1257 states and 1509 transitions. Second operand has 22 states, 20 states have (on average 3.05) internal successors, (61), 22 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18)