./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2188f6336d1ca1c280fca67f4da63aab9226326f5793dc0ad50e5520551c6099 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:49:33,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:49:33,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:49:33,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:49:33,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:49:33,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:49:33,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:49:33,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:49:33,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:49:33,402 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:49:33,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:49:33,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:49:33,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:49:33,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:49:33,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:49:33,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:49:33,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:49:33,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:33,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:49:33,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:49:33,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:49:33,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:49:33,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:49:33,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:49:33,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:49:33,405 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-jdk21/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 -> 2188f6336d1ca1c280fca67f4da63aab9226326f5793dc0ad50e5520551c6099 [2025-02-06 03:49:33,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:49:33,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:49:33,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:49:33,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:49:33,695 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:49:33,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i [2025-02-06 03:49:34,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78f1f9b66/cfeaa1e9a26b484586851f6390b74d53/FLAG6b59426d2 [2025-02-06 03:49:35,171 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:49:35,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i [2025-02-06 03:49:35,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78f1f9b66/cfeaa1e9a26b484586851f6390b74d53/FLAG6b59426d2 [2025-02-06 03:49:35,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78f1f9b66/cfeaa1e9a26b484586851f6390b74d53 [2025-02-06 03:49:35,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:49:35,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:49:35,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:35,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:49:35,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:49:35,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549bb462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35, skipping insertion in model container [2025-02-06 03:49:35,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:49:35,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i[916,929] [2025-02-06 03:49:35,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:35,750 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:49:35,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i[916,929] [2025-02-06 03:49:35,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:35,816 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:49:35,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35 WrapperNode [2025-02-06 03:49:35,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:35,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:35,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:49:35,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:49:35,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,850 INFO L138 Inliner]: procedures = 27, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2025-02-06 03:49:35,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:35,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:49:35,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:49:35,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:49:35,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,883 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-02-06 03:49:35,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:49:35,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:49:35,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:49:35,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:49:35,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (1/1) ... [2025-02-06 03:49:35,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:35,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:49:35,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:49:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:49:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 03:49:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 03:49:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:49:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:49:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:49:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:49:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:49:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:49:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:49:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:49:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:49:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:49:36,018 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:49:36,019 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:49:36,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem67#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite74#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite100#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite117#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1; [2025-02-06 03:49:36,343 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-02-06 03:49:36,343 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:49:36,349 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:49:36,350 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:49:36,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:36 BoogieIcfgContainer [2025-02-06 03:49:36,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:49:36,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:49:36,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:49:36,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:49:36,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:49:35" (1/3) ... [2025-02-06 03:49:36,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b885765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:36, skipping insertion in model container [2025-02-06 03:49:36,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:35" (2/3) ... [2025-02-06 03:49:36,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b885765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:36, skipping insertion in model container [2025-02-06 03:49:36,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:36" (3/3) ... [2025-02-06 03:49:36,356 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-27.i [2025-02-06 03:49:36,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:49:36,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-27.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:49:36,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:49:36,404 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;@1a6ca819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:49:36,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:49:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:49:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:49:36,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:36,414 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:36,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash -724485341, now seen corresponding path program 1 times [2025-02-06 03:49:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744860900] [2025-02-06 03:49:36,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:36,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:49:36,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:49:36,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:36,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:49:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744860900] [2025-02-06 03:49:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744860900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880264008] [2025-02-06 03:49:36,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:36,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:36,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:36,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:49:36,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:49:36,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:49:36,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:36,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:36,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:49:36,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:49:36,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:36,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880264008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:36,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:49:36,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:49:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550957783] [2025-02-06 03:49:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:49:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:36,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:49:36,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:36,833 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:36,851 INFO L93 Difference]: Finished difference Result 180 states and 280 transitions. [2025-02-06 03:49:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:49:36,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-02-06 03:49:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:36,857 INFO L225 Difference]: With dead ends: 180 [2025-02-06 03:49:36,857 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 03:49:36,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:36,862 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:36,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 03:49:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 03:49:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:49:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-02-06 03:49:36,901 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 131 [2025-02-06 03:49:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:36,902 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-02-06 03:49:36,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-02-06 03:49:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:49:36,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:36,907 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:36,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:49:37,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:49:37,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:37,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1046970766, now seen corresponding path program 1 times [2025-02-06 03:49:37,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:37,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454105230] [2025-02-06 03:49:37,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:37,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:37,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:49:37,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:49:37,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:37,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454105230] [2025-02-06 03:49:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454105230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885446197] [2025-02-06 03:49:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:38,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:38,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:38,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:38,412 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:38,745 INFO L93 Difference]: Finished difference Result 244 states and 351 transitions. [2025-02-06 03:49:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:38,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-02-06 03:49:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:38,747 INFO L225 Difference]: With dead ends: 244 [2025-02-06 03:49:38,747 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 03:49:38,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:38,748 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:38,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 260 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 03:49:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-02-06 03:49:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 126 states have (on average 1.3650793650793651) internal successors, (172), 127 states have internal predecessors, (172), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:49:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2025-02-06 03:49:38,772 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 131 [2025-02-06 03:49:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:38,772 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2025-02-06 03:49:38,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2025-02-06 03:49:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:49:38,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:38,773 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:38,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:49:38,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:38,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1891442637, now seen corresponding path program 1 times [2025-02-06 03:49:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564109125] [2025-02-06 03:49:38,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:38,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:49:38,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:49:38,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:38,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564109125] [2025-02-06 03:49:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564109125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:49:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341585987] [2025-02-06 03:49:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:39,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:49:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:39,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:49:39,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:49:39,525 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:39,712 INFO L93 Difference]: Finished difference Result 456 states and 660 transitions. [2025-02-06 03:49:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:49:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-02-06 03:49:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:39,715 INFO L225 Difference]: With dead ends: 456 [2025-02-06 03:49:39,716 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 03:49:39,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-02-06 03:49:39,717 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 77 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:39,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 306 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 03:49:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2025-02-06 03:49:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 244 states have (on average 1.360655737704918) internal successors, (332), 246 states have internal predecessors, (332), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:49:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 432 transitions. [2025-02-06 03:49:39,757 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 432 transitions. Word has length 131 [2025-02-06 03:49:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:39,761 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 432 transitions. [2025-02-06 03:49:39,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 432 transitions. [2025-02-06 03:49:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:49:39,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:39,764 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:39,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:49:39,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:39,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 197793715, now seen corresponding path program 1 times [2025-02-06 03:49:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:39,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680613672] [2025-02-06 03:49:39,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:39,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:49:39,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:49:39,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:39,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:40,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680613672] [2025-02-06 03:49:40,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680613672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:40,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286441481] [2025-02-06 03:49:40,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:40,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:40,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:40,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:40,609 INFO L87 Difference]: Start difference. First operand 299 states and 432 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:40,952 INFO L93 Difference]: Finished difference Result 731 states and 1048 transitions. [2025-02-06 03:49:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-02-06 03:49:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:40,955 INFO L225 Difference]: With dead ends: 731 [2025-02-06 03:49:40,955 INFO L226 Difference]: Without dead ends: 435 [2025-02-06 03:49:40,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:40,956 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 78 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:40,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 547 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-02-06 03:49:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 213. [2025-02-06 03:49:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3333333333333333) internal successors, (232), 174 states have internal predecessors, (232), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:49:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 300 transitions. [2025-02-06 03:49:40,975 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 300 transitions. Word has length 131 [2025-02-06 03:49:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:40,975 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 300 transitions. [2025-02-06 03:49:40,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 300 transitions. [2025-02-06 03:49:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:49:40,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:40,977 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:40,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:49:40,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:40,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash 362286614, now seen corresponding path program 1 times [2025-02-06 03:49:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960839155] [2025-02-06 03:49:40,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:40,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:49:41,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:49:41,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:41,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960839155] [2025-02-06 03:49:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960839155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:42,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:49:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048688782] [2025-02-06 03:49:42,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:42,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:49:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:42,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:49:42,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:49:42,016 INFO L87 Difference]: Start difference. First operand 213 states and 300 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:42,455 INFO L93 Difference]: Finished difference Result 429 states and 601 transitions. [2025-02-06 03:49:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:49:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-06 03:49:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:42,460 INFO L225 Difference]: With dead ends: 429 [2025-02-06 03:49:42,460 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 03:49:42,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:49:42,461 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 165 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:42,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 595 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:49:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 03:49:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2025-02-06 03:49:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 231 states have (on average 1.3463203463203464) internal successors, (311), 232 states have internal predecessors, (311), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 383 transitions. [2025-02-06 03:49:42,484 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 383 transitions. Word has length 132 [2025-02-06 03:49:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:42,485 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 383 transitions. [2025-02-06 03:49:42,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 383 transitions. [2025-02-06 03:49:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:49:42,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:42,486 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:42,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:49:42,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:42,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1869838423, now seen corresponding path program 1 times [2025-02-06 03:49:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:42,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069055067] [2025-02-06 03:49:42,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:42,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:49:42,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:49:42,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:42,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:49:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069055067] [2025-02-06 03:49:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069055067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184837638] [2025-02-06 03:49:42,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:42,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:42,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:42,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:49:43,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:49:43,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:49:43,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:43,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:49:43,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:43,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:43,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-06 03:49:43,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:43,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 31 [2025-02-06 03:49:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:43,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184837638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:43,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:49:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-02-06 03:49:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473761581] [2025-02-06 03:49:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:43,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:43,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:43,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:43,158 INFO L87 Difference]: Start difference. First operand 273 states and 383 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:43,332 INFO L93 Difference]: Finished difference Result 536 states and 751 transitions. [2025-02-06 03:49:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:49:43,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-06 03:49:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:43,334 INFO L225 Difference]: With dead ends: 536 [2025-02-06 03:49:43,334 INFO L226 Difference]: Without dead ends: 368 [2025-02-06 03:49:43,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:49:43,335 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 55 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:43,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 468 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:49:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-06 03:49:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 286. [2025-02-06 03:49:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 244 states have (on average 1.348360655737705) internal successors, (329), 245 states have internal predecessors, (329), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 401 transitions. [2025-02-06 03:49:43,354 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 401 transitions. Word has length 132 [2025-02-06 03:49:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:43,354 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 401 transitions. [2025-02-06 03:49:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 401 transitions. [2025-02-06 03:49:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:49:43,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:43,355 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:43,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:49:43,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:43,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:43,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1050665041, now seen corresponding path program 1 times [2025-02-06 03:49:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968571649] [2025-02-06 03:49:43,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:43,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:49:43,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:49:43,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:43,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:43,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:43,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968571649] [2025-02-06 03:49:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968571649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:43,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:43,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:49:43,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114226516] [2025-02-06 03:49:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:43,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:49:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:43,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:49:43,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:49:43,986 INFO L87 Difference]: Start difference. First operand 286 states and 401 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:44,165 INFO L93 Difference]: Finished difference Result 577 states and 808 transitions. [2025-02-06 03:49:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:49:44,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-02-06 03:49:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:44,167 INFO L225 Difference]: With dead ends: 577 [2025-02-06 03:49:44,167 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 03:49:44,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-02-06 03:49:44,168 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 70 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:44,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 301 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 03:49:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 286. [2025-02-06 03:49:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 244 states have (on average 1.3442622950819672) internal successors, (328), 245 states have internal predecessors, (328), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2025-02-06 03:49:44,182 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 133 [2025-02-06 03:49:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:44,182 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2025-02-06 03:49:44,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2025-02-06 03:49:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:49:44,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:44,183 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:44,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:49:44,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:44,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2074009228, now seen corresponding path program 1 times [2025-02-06 03:49:44,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:44,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069552289] [2025-02-06 03:49:44,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:44,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:49:44,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:49:44,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:44,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069552289] [2025-02-06 03:49:44,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069552289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:44,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:44,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:44,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89159856] [2025-02-06 03:49:44,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:44,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:44,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:44,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:44,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:44,354 INFO L87 Difference]: Start difference. First operand 286 states and 400 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:44,655 INFO L93 Difference]: Finished difference Result 577 states and 806 transitions. [2025-02-06 03:49:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:44,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:49:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:44,657 INFO L225 Difference]: With dead ends: 577 [2025-02-06 03:49:44,658 INFO L226 Difference]: Without dead ends: 396 [2025-02-06 03:49:44,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:44,658 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 106 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:44,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 356 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-06 03:49:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2025-02-06 03:49:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 315 states have (on average 1.33015873015873) internal successors, (419), 316 states have internal predecessors, (419), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 03:49:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 525 transitions. [2025-02-06 03:49:44,701 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 525 transitions. Word has length 134 [2025-02-06 03:49:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:44,701 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 525 transitions. [2025-02-06 03:49:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 525 transitions. [2025-02-06 03:49:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:49:44,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:44,702 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:44,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:49:44,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1550261557, now seen corresponding path program 1 times [2025-02-06 03:49:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:44,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72894723] [2025-02-06 03:49:44,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:44,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:49:44,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:49:44,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:44,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:44,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:44,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72894723] [2025-02-06 03:49:44,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72894723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:44,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:44,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130527249] [2025-02-06 03:49:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:44,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:44,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:44,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:44,901 INFO L87 Difference]: Start difference. First operand 377 states and 525 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:45,185 INFO L93 Difference]: Finished difference Result 683 states and 949 transitions. [2025-02-06 03:49:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:49:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:45,188 INFO L225 Difference]: With dead ends: 683 [2025-02-06 03:49:45,188 INFO L226 Difference]: Without dead ends: 385 [2025-02-06 03:49:45,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:45,192 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 102 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:45,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 432 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-06 03:49:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 275. [2025-02-06 03:49:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 232 states have (on average 1.3146551724137931) internal successors, (305), 233 states have internal predecessors, (305), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 377 transitions. [2025-02-06 03:49:45,216 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 377 transitions. Word has length 134 [2025-02-06 03:49:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:45,217 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 377 transitions. [2025-02-06 03:49:45,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 377 transitions. [2025-02-06 03:49:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:49:45,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:45,220 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:45,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:49:45,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:45,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1233823076, now seen corresponding path program 1 times [2025-02-06 03:49:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76260532] [2025-02-06 03:49:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:45,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:49:45,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:49:45,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:45,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76260532] [2025-02-06 03:49:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76260532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:46,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:49:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211797670] [2025-02-06 03:49:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:46,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:49:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:46,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:49:46,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:46,107 INFO L87 Difference]: Start difference. First operand 275 states and 377 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:46,382 INFO L93 Difference]: Finished difference Result 740 states and 1012 transitions. [2025-02-06 03:49:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:49:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-06 03:49:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:46,385 INFO L225 Difference]: With dead ends: 740 [2025-02-06 03:49:46,385 INFO L226 Difference]: Without dead ends: 468 [2025-02-06 03:49:46,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:46,386 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:46,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 498 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-06 03:49:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 352. [2025-02-06 03:49:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 309 states have (on average 1.313915857605178) internal successors, (406), 310 states have internal predecessors, (406), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 478 transitions. [2025-02-06 03:49:46,409 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 478 transitions. Word has length 135 [2025-02-06 03:49:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:46,411 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 478 transitions. [2025-02-06 03:49:46,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 478 transitions. [2025-02-06 03:49:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:49:46,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:46,415 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:46,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:49:46,415 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:46,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 303656623, now seen corresponding path program 1 times [2025-02-06 03:49:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225116569] [2025-02-06 03:49:46,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:46,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:49:46,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:49:46,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:46,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225116569] [2025-02-06 03:49:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225116569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:47,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:49:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964481609] [2025-02-06 03:49:47,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:47,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:49:47,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:47,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:49:47,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:49:47,324 INFO L87 Difference]: Start difference. First operand 352 states and 478 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:47,708 INFO L93 Difference]: Finished difference Result 819 states and 1115 transitions. [2025-02-06 03:49:47,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:49:47,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:49:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:47,711 INFO L225 Difference]: With dead ends: 819 [2025-02-06 03:49:47,711 INFO L226 Difference]: Without dead ends: 470 [2025-02-06 03:49:47,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:49:47,712 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:47,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 779 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-06 03:49:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 403. [2025-02-06 03:49:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 360 states have (on average 1.3111111111111111) internal successors, (472), 361 states have internal predecessors, (472), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 544 transitions. [2025-02-06 03:49:47,730 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 544 transitions. Word has length 135 [2025-02-06 03:49:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:47,730 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 544 transitions. [2025-02-06 03:49:47,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 544 transitions. [2025-02-06 03:49:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:49:47,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:47,732 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:47,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:49:47,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:47,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash 432739342, now seen corresponding path program 1 times [2025-02-06 03:49:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412461346] [2025-02-06 03:49:47,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:47,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:49:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:49:47,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:47,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412461346] [2025-02-06 03:49:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412461346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:48,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:48,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019907145] [2025-02-06 03:49:48,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:48,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:48,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:48,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:48,387 INFO L87 Difference]: Start difference. First operand 403 states and 544 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:48,630 INFO L93 Difference]: Finished difference Result 876 states and 1183 transitions. [2025-02-06 03:49:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:48,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:49:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:48,632 INFO L225 Difference]: With dead ends: 876 [2025-02-06 03:49:48,632 INFO L226 Difference]: Without dead ends: 476 [2025-02-06 03:49:48,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:48,633 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:48,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 550 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-06 03:49:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 386. [2025-02-06 03:49:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 343 states have (on average 1.3061224489795917) internal successors, (448), 344 states have internal predecessors, (448), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 520 transitions. [2025-02-06 03:49:48,651 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 520 transitions. Word has length 135 [2025-02-06 03:49:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:48,651 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 520 transitions. [2025-02-06 03:49:48,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 520 transitions. [2025-02-06 03:49:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:49:48,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:48,653 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:48,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:49:48,653 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:48,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash -105167602, now seen corresponding path program 1 times [2025-02-06 03:49:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181326933] [2025-02-06 03:49:48,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:48,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:49:48,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:49:48,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:48,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181326933] [2025-02-06 03:49:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181326933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785255580] [2025-02-06 03:49:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:49,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:49,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:49,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:49,189 INFO L87 Difference]: Start difference. First operand 386 states and 520 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:49,423 INFO L93 Difference]: Finished difference Result 812 states and 1092 transitions. [2025-02-06 03:49:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:49:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:49,425 INFO L225 Difference]: With dead ends: 812 [2025-02-06 03:49:49,426 INFO L226 Difference]: Without dead ends: 429 [2025-02-06 03:49:49,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:49,428 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 53 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:49,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 460 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-06 03:49:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 337. [2025-02-06 03:49:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 296 states have (on average 1.2837837837837838) internal successors, (380), 296 states have internal predecessors, (380), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:49:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 448 transitions. [2025-02-06 03:49:49,450 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 448 transitions. Word has length 135 [2025-02-06 03:49:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:49,450 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 448 transitions. [2025-02-06 03:49:49,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 448 transitions. [2025-02-06 03:49:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:49:49,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:49,451 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:49,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:49:49,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:49,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:49,451 INFO L85 PathProgramCache]: Analyzing trace with hash 23915117, now seen corresponding path program 1 times [2025-02-06 03:49:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:49,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288346587] [2025-02-06 03:49:49,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:49,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:49,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:49:49,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:49:49,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:49,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288346587] [2025-02-06 03:49:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288346587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:50,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:50,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:49:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606002988] [2025-02-06 03:49:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:50,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:49:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:50,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:49:50,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:50,049 INFO L87 Difference]: Start difference. First operand 337 states and 448 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:50,454 INFO L93 Difference]: Finished difference Result 702 states and 936 transitions. [2025-02-06 03:49:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:49:50,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-02-06 03:49:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:50,456 INFO L225 Difference]: With dead ends: 702 [2025-02-06 03:49:50,456 INFO L226 Difference]: Without dead ends: 368 [2025-02-06 03:49:50,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:49:50,457 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 45 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:50,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 959 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-06 03:49:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 331. [2025-02-06 03:49:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 290 states have (on average 1.282758620689655) internal successors, (372), 290 states have internal predecessors, (372), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:49:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 440 transitions. [2025-02-06 03:49:50,477 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 440 transitions. Word has length 135 [2025-02-06 03:49:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 440 transitions. [2025-02-06 03:49:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 440 transitions. [2025-02-06 03:49:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:49:50,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:50,479 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:50,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:49:50,479 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:50,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1264842883, now seen corresponding path program 1 times [2025-02-06 03:49:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:50,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167656016] [2025-02-06 03:49:50,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:49:50,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:49:50,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:50,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:50,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:50,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167656016] [2025-02-06 03:49:50,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167656016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:50,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:50,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:50,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189197013] [2025-02-06 03:49:50,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:50,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:50,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:50,845 INFO L87 Difference]: Start difference. First operand 331 states and 440 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:51,128 INFO L93 Difference]: Finished difference Result 771 states and 1020 transitions. [2025-02-06 03:49:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-06 03:49:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:51,131 INFO L225 Difference]: With dead ends: 771 [2025-02-06 03:49:51,131 INFO L226 Difference]: Without dead ends: 443 [2025-02-06 03:49:51,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:51,133 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 76 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:51,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 504 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-06 03:49:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2025-02-06 03:49:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 372 states have (on average 1.2634408602150538) internal successors, (470), 374 states have internal predecessors, (470), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:49:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 578 transitions. [2025-02-06 03:49:51,157 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 578 transitions. Word has length 135 [2025-02-06 03:49:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:51,159 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 578 transitions. [2025-02-06 03:49:51,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 578 transitions. [2025-02-06 03:49:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:49:51,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:51,160 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:51,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:49:51,161 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:51,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash -532108476, now seen corresponding path program 1 times [2025-02-06 03:49:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:51,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829726697] [2025-02-06 03:49:51,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:51,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:49:51,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:49:51,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:51,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829726697] [2025-02-06 03:49:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829726697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:51,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:51,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:51,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217153914] [2025-02-06 03:49:51,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:51,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:51,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:51,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:51,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:51,505 INFO L87 Difference]: Start difference. First operand 439 states and 578 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:51,758 INFO L93 Difference]: Finished difference Result 981 states and 1289 transitions. [2025-02-06 03:49:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-02-06 03:49:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:51,760 INFO L225 Difference]: With dead ends: 981 [2025-02-06 03:49:51,760 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 03:49:51,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:51,763 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:51,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 329 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 03:49:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 449. [2025-02-06 03:49:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 382 states have (on average 1.2486910994764397) internal successors, (477), 384 states have internal predecessors, (477), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:49:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 585 transitions. [2025-02-06 03:49:51,786 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 585 transitions. Word has length 135 [2025-02-06 03:49:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:51,787 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 585 transitions. [2025-02-06 03:49:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:49:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 585 transitions. [2025-02-06 03:49:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:51,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:51,789 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:51,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:49:51,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:51,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1319837564, now seen corresponding path program 1 times [2025-02-06 03:49:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:51,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214968784] [2025-02-06 03:49:51,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:51,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:51,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:51,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:51,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214968784] [2025-02-06 03:49:51,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214968784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:51,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:51,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937955634] [2025-02-06 03:49:51,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:51,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:51,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:51,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:51,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:51,913 INFO L87 Difference]: Start difference. First operand 449 states and 585 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:52,066 INFO L93 Difference]: Finished difference Result 991 states and 1292 transitions. [2025-02-06 03:49:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:49:52,066 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:49:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:52,069 INFO L225 Difference]: With dead ends: 991 [2025-02-06 03:49:52,069 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 03:49:52,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:52,071 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 89 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:52,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 262 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:49:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 03:49:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 461. [2025-02-06 03:49:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 396 states have internal predecessors, (491), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:49:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 599 transitions. [2025-02-06 03:49:52,093 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 599 transitions. Word has length 139 [2025-02-06 03:49:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:52,093 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 599 transitions. [2025-02-06 03:49:52,094 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 599 transitions. [2025-02-06 03:49:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:52,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:52,096 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:52,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:49:52,096 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:52,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -487616899, now seen corresponding path program 1 times [2025-02-06 03:49:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529787014] [2025-02-06 03:49:52,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:52,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:52,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:52,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:49:52,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529787014] [2025-02-06 03:49:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529787014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385816821] [2025-02-06 03:49:52,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:52,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:52,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:52,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:52,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:49:52,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:52,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:52,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:49:52,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:52,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385816821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:52,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:49:52,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:49:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731208995] [2025-02-06 03:49:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:52,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:52,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:52,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:52,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:52,376 INFO L87 Difference]: Start difference. First operand 461 states and 599 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:52,418 INFO L93 Difference]: Finished difference Result 933 states and 1213 transitions. [2025-02-06 03:49:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:49:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:52,422 INFO L225 Difference]: With dead ends: 933 [2025-02-06 03:49:52,422 INFO L226 Difference]: Without dead ends: 475 [2025-02-06 03:49:52,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:52,424 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:52,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-06 03:49:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2025-02-06 03:49:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 408 states have (on average 1.2377450980392157) internal successors, (505), 410 states have internal predecessors, (505), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:49:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 613 transitions. [2025-02-06 03:49:52,446 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 613 transitions. Word has length 139 [2025-02-06 03:49:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:52,446 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 613 transitions. [2025-02-06 03:49:52,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 613 transitions. [2025-02-06 03:49:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:52,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:52,448 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:52,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:49:52,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:52,649 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:52,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1930499200, now seen corresponding path program 1 times [2025-02-06 03:49:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:52,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455189493] [2025-02-06 03:49:52,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:52,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:52,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:52,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:52,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:49:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455189493] [2025-02-06 03:49:53,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455189493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725880810] [2025-02-06 03:49:53,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:53,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:53,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:53,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:53,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:49:53,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:53,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:53,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:53,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:53,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:49:53,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:53,249 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 21 treesize of output 21 [2025-02-06 03:49:53,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:53,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 42 [2025-02-06 03:49:53,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:53,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 47 [2025-02-06 03:49:53,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:53,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 19 [2025-02-06 03:49:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:49:53,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:49:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:53,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725880810] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:53,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:49:53,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 13] total 19 [2025-02-06 03:49:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288315508] [2025-02-06 03:49:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:53,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:49:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:53,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:49:53,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:49:53,695 INFO L87 Difference]: Start difference. First operand 475 states and 613 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:54,131 INFO L93 Difference]: Finished difference Result 1221 states and 1569 transitions. [2025-02-06 03:49:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:49:54,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:49:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:54,134 INFO L225 Difference]: With dead ends: 1221 [2025-02-06 03:49:54,134 INFO L226 Difference]: Without dead ends: 749 [2025-02-06 03:49:54,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:49:54,136 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 51 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:54,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 890 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-02-06 03:49:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 619. [2025-02-06 03:49:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 552 states have (on average 1.2536231884057971) internal successors, (692), 554 states have internal predecessors, (692), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:49:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 800 transitions. [2025-02-06 03:49:54,169 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 800 transitions. Word has length 139 [2025-02-06 03:49:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:54,169 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 800 transitions. [2025-02-06 03:49:54,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 800 transitions. [2025-02-06 03:49:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:54,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:54,172 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:54,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:49:54,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:54,373 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:54,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash 557013633, now seen corresponding path program 1 times [2025-02-06 03:49:54,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:54,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241328863] [2025-02-06 03:49:54,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:54,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:54,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:54,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:54,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241328863] [2025-02-06 03:49:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241328863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74119690] [2025-02-06 03:49:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:54,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:54,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:54,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:54,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:54,805 INFO L87 Difference]: Start difference. First operand 619 states and 800 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:55,027 INFO L93 Difference]: Finished difference Result 1375 states and 1764 transitions. [2025-02-06 03:49:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:49:55,028 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:49:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:55,031 INFO L225 Difference]: With dead ends: 1375 [2025-02-06 03:49:55,031 INFO L226 Difference]: Without dead ends: 759 [2025-02-06 03:49:55,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-02-06 03:49:55,033 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 50 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:55,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 393 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-02-06 03:49:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 753. [2025-02-06 03:49:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 662 states have (on average 1.2356495468277946) internal successors, (818), 668 states have internal predecessors, (818), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:49:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 958 transitions. [2025-02-06 03:49:55,067 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 958 transitions. Word has length 139 [2025-02-06 03:49:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:55,068 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 958 transitions. [2025-02-06 03:49:55,068 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 958 transitions. [2025-02-06 03:49:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:55,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:55,069 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:55,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:49:55,069 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:55,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1069171106, now seen corresponding path program 1 times [2025-02-06 03:49:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486666715] [2025-02-06 03:49:55,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:55,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:55,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:55,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:55,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486666715] [2025-02-06 03:49:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486666715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:55,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:55,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:49:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629102025] [2025-02-06 03:49:55,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:55,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:49:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:55,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:49:55,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:55,766 INFO L87 Difference]: Start difference. First operand 753 states and 958 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:56,389 INFO L93 Difference]: Finished difference Result 1910 states and 2421 transitions. [2025-02-06 03:49:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:49:56,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:49:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:56,397 INFO L225 Difference]: With dead ends: 1910 [2025-02-06 03:49:56,397 INFO L226 Difference]: Without dead ends: 1160 [2025-02-06 03:49:56,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:49:56,399 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 285 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:56,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 763 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:49:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-02-06 03:49:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 811. [2025-02-06 03:49:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 720 states have (on average 1.2402777777777778) internal successors, (893), 726 states have internal predecessors, (893), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:49:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1033 transitions. [2025-02-06 03:49:56,435 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1033 transitions. Word has length 139 [2025-02-06 03:49:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:56,435 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1033 transitions. [2025-02-06 03:49:56,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1033 transitions. [2025-02-06 03:49:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:56,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:56,436 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:56,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:49:56,437 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:56,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash -738283357, now seen corresponding path program 1 times [2025-02-06 03:49:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:56,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949575310] [2025-02-06 03:49:56,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:56,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:56,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:56,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:56,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:56,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949575310] [2025-02-06 03:49:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949575310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:57,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:49:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624676456] [2025-02-06 03:49:57,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:57,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:49:57,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:57,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:49:57,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:57,247 INFO L87 Difference]: Start difference. First operand 811 states and 1033 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:57,702 INFO L93 Difference]: Finished difference Result 1949 states and 2478 transitions. [2025-02-06 03:49:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:49:57,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:49:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:57,706 INFO L225 Difference]: With dead ends: 1949 [2025-02-06 03:49:57,706 INFO L226 Difference]: Without dead ends: 1141 [2025-02-06 03:49:57,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:49:57,709 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 49 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:57,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 998 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:49:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-02-06 03:49:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 950. [2025-02-06 03:49:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 859 states have (on average 1.250291036088475) internal successors, (1074), 865 states have internal predecessors, (1074), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:49:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1214 transitions. [2025-02-06 03:49:57,746 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1214 transitions. Word has length 139 [2025-02-06 03:49:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:57,747 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1214 transitions. [2025-02-06 03:49:57,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1214 transitions. [2025-02-06 03:49:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:57,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:57,748 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:49:57,749 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash -968885183, now seen corresponding path program 1 times [2025-02-06 03:49:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834592259] [2025-02-06 03:49:57,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:57,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:57,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:57,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:57,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834592259] [2025-02-06 03:49:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834592259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:58,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:58,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600915577] [2025-02-06 03:49:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:58,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:58,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:58,091 INFO L87 Difference]: Start difference. First operand 950 states and 1214 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:58,301 INFO L93 Difference]: Finished difference Result 2123 states and 2694 transitions. [2025-02-06 03:49:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:49:58,301 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:49:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:58,305 INFO L225 Difference]: With dead ends: 2123 [2025-02-06 03:49:58,305 INFO L226 Difference]: Without dead ends: 1176 [2025-02-06 03:49:58,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-02-06 03:49:58,307 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 52 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:58,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 411 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:49:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-02-06 03:49:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 903. [2025-02-06 03:49:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 812 states have (on average 1.2463054187192117) internal successors, (1012), 818 states have internal predecessors, (1012), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:49:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1152 transitions. [2025-02-06 03:49:58,343 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1152 transitions. Word has length 139 [2025-02-06 03:49:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:58,344 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1152 transitions. [2025-02-06 03:49:58,344 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:49:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1152 transitions. [2025-02-06 03:49:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:49:58,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:58,345 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:58,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:49:58,346 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:58,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1017543623, now seen corresponding path program 1 times [2025-02-06 03:49:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:58,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612867194] [2025-02-06 03:49:58,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:58,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:49:58,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:49:58,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:58,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:49:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612867194] [2025-02-06 03:49:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612867194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:59,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:49:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357109600] [2025-02-06 03:49:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:59,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:49:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:59,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:49:59,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:59,359 INFO L87 Difference]: Start difference. First operand 903 states and 1152 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:50:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:00,255 INFO L93 Difference]: Finished difference Result 1999 states and 2538 transitions. [2025-02-06 03:50:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:50:00,256 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2025-02-06 03:50:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:00,260 INFO L225 Difference]: With dead ends: 1999 [2025-02-06 03:50:00,260 INFO L226 Difference]: Without dead ends: 1099 [2025-02-06 03:50:00,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:50:00,262 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 304 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:00,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 500 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:50:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-06 03:50:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 972. [2025-02-06 03:50:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 863 states have (on average 1.2375434530706837) internal successors, (1068), 870 states have internal predecessors, (1068), 82 states have call successors, (82), 26 states have call predecessors, (82), 26 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:50:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1232 transitions. [2025-02-06 03:50:00,312 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1232 transitions. Word has length 139 [2025-02-06 03:50:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:00,313 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1232 transitions. [2025-02-06 03:50:00,313 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:50:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1232 transitions. [2025-02-06 03:50:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:50:00,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:00,315 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:00,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:50:00,315 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:00,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1480464900, now seen corresponding path program 1 times [2025-02-06 03:50:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:00,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068639639] [2025-02-06 03:50:00,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:50:00,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:50:00,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:00,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068639639] [2025-02-06 03:50:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068639639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:50:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631139127] [2025-02-06 03:50:00,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:00,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:50:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:00,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:50:00,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:50:00,545 INFO L87 Difference]: Start difference. First operand 972 states and 1232 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:00,858 INFO L93 Difference]: Finished difference Result 2058 states and 2607 transitions. [2025-02-06 03:50:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:50:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:50:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:00,866 INFO L225 Difference]: With dead ends: 2058 [2025-02-06 03:50:00,870 INFO L226 Difference]: Without dead ends: 1106 [2025-02-06 03:50:00,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-02-06 03:50:00,873 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 57 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:00,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 767 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:50:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-02-06 03:50:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1002. [2025-02-06 03:50:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 893 states have (on average 1.240761478163494) internal successors, (1108), 900 states have internal predecessors, (1108), 82 states have call successors, (82), 26 states have call predecessors, (82), 26 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:50:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1272 transitions. [2025-02-06 03:50:00,929 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1272 transitions. Word has length 139 [2025-02-06 03:50:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:00,929 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1272 transitions. [2025-02-06 03:50:00,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1272 transitions. [2025-02-06 03:50:00,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:50:00,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:00,931 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:00,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:50:00,931 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:00,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:00,931 INFO L85 PathProgramCache]: Analyzing trace with hash 814667399, now seen corresponding path program 1 times [2025-02-06 03:50:00,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:00,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277411268] [2025-02-06 03:50:00,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:00,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:00,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:50:00,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:50:00,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:00,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277411268] [2025-02-06 03:50:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277411268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:01,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:50:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194283332] [2025-02-06 03:50:01,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:01,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:50:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:01,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:50:01,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:50:01,427 INFO L87 Difference]: Start difference. First operand 1002 states and 1272 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:01,725 INFO L93 Difference]: Finished difference Result 1988 states and 2517 transitions. [2025-02-06 03:50:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:50:01,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-02-06 03:50:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:01,729 INFO L225 Difference]: With dead ends: 1988 [2025-02-06 03:50:01,729 INFO L226 Difference]: Without dead ends: 1006 [2025-02-06 03:50:01,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-02-06 03:50:01,731 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:01,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 384 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:50:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-02-06 03:50:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 980. [2025-02-06 03:50:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 867 states have (on average 1.2249134948096885) internal successors, (1062), 874 states have internal predecessors, (1062), 82 states have call successors, (82), 30 states have call predecessors, (82), 30 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:50:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1226 transitions. [2025-02-06 03:50:01,788 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1226 transitions. Word has length 140 [2025-02-06 03:50:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:01,788 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1226 transitions. [2025-02-06 03:50:01,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1226 transitions. [2025-02-06 03:50:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:50:01,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:01,789 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:01,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:50:01,790 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:01,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash -438483656, now seen corresponding path program 1 times [2025-02-06 03:50:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242508221] [2025-02-06 03:50:01,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:01,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:50:01,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:50:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242508221] [2025-02-06 03:50:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242508221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:50:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489422317] [2025-02-06 03:50:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:02,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:50:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:02,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:50:02,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:50:02,419 INFO L87 Difference]: Start difference. First operand 980 states and 1226 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:02,870 INFO L93 Difference]: Finished difference Result 1568 states and 1914 transitions. [2025-02-06 03:50:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:50:02,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-02-06 03:50:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:02,877 INFO L225 Difference]: With dead ends: 1568 [2025-02-06 03:50:02,877 INFO L226 Difference]: Without dead ends: 1566 [2025-02-06 03:50:02,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:50:02,878 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 67 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:02,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 830 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:50:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-02-06 03:50:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1562. [2025-02-06 03:50:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1349 states have (on average 1.1816160118606376) internal successors, (1594), 1364 states have internal predecessors, (1594), 154 states have call successors, (154), 58 states have call predecessors, (154), 58 states have return successors, (154), 139 states have call predecessors, (154), 154 states have call successors, (154) [2025-02-06 03:50:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1902 transitions. [2025-02-06 03:50:03,034 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1902 transitions. Word has length 141 [2025-02-06 03:50:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:03,035 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 1902 transitions. [2025-02-06 03:50:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1902 transitions. [2025-02-06 03:50:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:50:03,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:03,037 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:03,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:50:03,038 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:03,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1582675836, now seen corresponding path program 1 times [2025-02-06 03:50:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433001562] [2025-02-06 03:50:03,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:03,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:03,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:50:03,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:50:03,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:03,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:03,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433001562] [2025-02-06 03:50:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433001562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:03,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:03,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:50:03,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532294419] [2025-02-06 03:50:03,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:03,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:50:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:03,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:50:03,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:03,463 INFO L87 Difference]: Start difference. First operand 1562 states and 1902 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:03,782 INFO L93 Difference]: Finished difference Result 3351 states and 4076 transitions. [2025-02-06 03:50:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:50:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-02-06 03:50:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:03,789 INFO L225 Difference]: With dead ends: 3351 [2025-02-06 03:50:03,790 INFO L226 Difference]: Without dead ends: 1693 [2025-02-06 03:50:03,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:50:03,792 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 123 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:03,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 436 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:50:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2025-02-06 03:50:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1499. [2025-02-06 03:50:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1286 states have (on average 1.166407465007776) internal successors, (1500), 1301 states have internal predecessors, (1500), 154 states have call successors, (154), 58 states have call predecessors, (154), 58 states have return successors, (154), 139 states have call predecessors, (154), 154 states have call successors, (154) [2025-02-06 03:50:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1808 transitions. [2025-02-06 03:50:03,913 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1808 transitions. Word has length 141 [2025-02-06 03:50:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:03,915 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1808 transitions. [2025-02-06 03:50:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1808 transitions. [2025-02-06 03:50:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:50:03,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:03,917 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:50:03,917 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:03,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 437969596, now seen corresponding path program 1 times [2025-02-06 03:50:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191681938] [2025-02-06 03:50:03,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:03,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:50:03,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:50:03,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:03,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191681938] [2025-02-06 03:50:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191681938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:50:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220926861] [2025-02-06 03:50:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:04,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:50:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:04,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:50:04,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:50:04,099 INFO L87 Difference]: Start difference. First operand 1499 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:04,398 INFO L93 Difference]: Finished difference Result 3172 states and 3823 transitions. [2025-02-06 03:50:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:50:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-02-06 03:50:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:04,408 INFO L225 Difference]: With dead ends: 3172 [2025-02-06 03:50:04,408 INFO L226 Difference]: Without dead ends: 1693 [2025-02-06 03:50:04,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:04,411 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 44 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:04,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 435 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:50:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2025-02-06 03:50:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1549. [2025-02-06 03:50:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1336 states have (on average 1.1631736526946108) internal successors, (1554), 1351 states have internal predecessors, (1554), 154 states have call successors, (154), 58 states have call predecessors, (154), 58 states have return successors, (154), 139 states have call predecessors, (154), 154 states have call successors, (154) [2025-02-06 03:50:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1862 transitions. [2025-02-06 03:50:04,502 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1862 transitions. Word has length 141 [2025-02-06 03:50:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:04,503 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 1862 transitions. [2025-02-06 03:50:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1862 transitions. [2025-02-06 03:50:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:50:04,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:04,505 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:04,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:50:04,505 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:04,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1340457827, now seen corresponding path program 1 times [2025-02-06 03:50:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469130682] [2025-02-06 03:50:04,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:04,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:04,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:50:04,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:50:04,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:04,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:04,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469130682] [2025-02-06 03:50:04,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469130682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:04,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:04,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:50:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956142525] [2025-02-06 03:50:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:04,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:50:04,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:04,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:50:04,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:04,886 INFO L87 Difference]: Start difference. First operand 1549 states and 1862 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:05,129 INFO L93 Difference]: Finished difference Result 2701 states and 3252 transitions. [2025-02-06 03:50:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:50:05,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2025-02-06 03:50:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:05,133 INFO L225 Difference]: With dead ends: 2701 [2025-02-06 03:50:05,133 INFO L226 Difference]: Without dead ends: 1172 [2025-02-06 03:50:05,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:50:05,135 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:05,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 279 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:50:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-06 03:50:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1136. [2025-02-06 03:50:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 975 states have (on average 1.1476923076923078) internal successors, (1119), 985 states have internal predecessors, (1119), 118 states have call successors, (118), 42 states have call predecessors, (118), 42 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-06 03:50:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1355 transitions. [2025-02-06 03:50:05,216 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1355 transitions. Word has length 142 [2025-02-06 03:50:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:05,216 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1355 transitions. [2025-02-06 03:50:05,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1355 transitions. [2025-02-06 03:50:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:50:05,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:05,219 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:05,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:50:05,219 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:05,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1389387224, now seen corresponding path program 1 times [2025-02-06 03:50:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195983663] [2025-02-06 03:50:05,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:05,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:50:05,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:50:05,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:05,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:05,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195983663] [2025-02-06 03:50:05,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195983663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:05,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:50:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652912171] [2025-02-06 03:50:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:05,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:50:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:05,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:50:05,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:50:05,862 INFO L87 Difference]: Start difference. First operand 1136 states and 1355 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:06,214 INFO L93 Difference]: Finished difference Result 2278 states and 2708 transitions. [2025-02-06 03:50:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:50:06,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2025-02-06 03:50:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:06,218 INFO L225 Difference]: With dead ends: 2278 [2025-02-06 03:50:06,218 INFO L226 Difference]: Without dead ends: 1145 [2025-02-06 03:50:06,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:50:06,220 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:06,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 423 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:50:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-02-06 03:50:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1112. [2025-02-06 03:50:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 951 states have (on average 1.1335436382754995) internal successors, (1078), 961 states have internal predecessors, (1078), 118 states have call successors, (118), 42 states have call predecessors, (118), 42 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-06 03:50:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1314 transitions. [2025-02-06 03:50:06,304 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1314 transitions. Word has length 142 [2025-02-06 03:50:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:06,304 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1314 transitions. [2025-02-06 03:50:06,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1314 transitions. [2025-02-06 03:50:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:50:06,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:06,306 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:06,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:50:06,306 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:06,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 780584069, now seen corresponding path program 1 times [2025-02-06 03:50:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:06,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380172235] [2025-02-06 03:50:06,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:06,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:50:06,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:50:06,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:06,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:06,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380172235] [2025-02-06 03:50:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380172235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:06,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:50:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415701068] [2025-02-06 03:50:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:06,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:50:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:06,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:50:06,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:06,588 INFO L87 Difference]: Start difference. First operand 1112 states and 1314 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:06,898 INFO L93 Difference]: Finished difference Result 2200 states and 2596 transitions. [2025-02-06 03:50:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:50:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-02-06 03:50:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:06,902 INFO L225 Difference]: With dead ends: 2200 [2025-02-06 03:50:06,903 INFO L226 Difference]: Without dead ends: 1091 [2025-02-06 03:50:06,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:50:06,905 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:06,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 498 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:50:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-02-06 03:50:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1051. [2025-02-06 03:50:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 890 states have (on average 1.1269662921348316) internal successors, (1003), 900 states have internal predecessors, (1003), 118 states have call successors, (118), 42 states have call predecessors, (118), 42 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-06 03:50:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1239 transitions. [2025-02-06 03:50:06,982 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1239 transitions. Word has length 143 [2025-02-06 03:50:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:06,985 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1239 transitions. [2025-02-06 03:50:06,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1239 transitions. [2025-02-06 03:50:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:50:06,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:06,987 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:06,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:50:06,988 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:06,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2016601674, now seen corresponding path program 1 times [2025-02-06 03:50:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:06,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431614258] [2025-02-06 03:50:06,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:07,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:50:07,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:50:07,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:07,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431614258] [2025-02-06 03:50:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431614258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:50:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432830862] [2025-02-06 03:50:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:07,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:50:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:07,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:50:07,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:50:07,878 INFO L87 Difference]: Start difference. First operand 1051 states and 1239 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:08,538 INFO L93 Difference]: Finished difference Result 2257 states and 2659 transitions. [2025-02-06 03:50:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:50:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2025-02-06 03:50:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:08,543 INFO L225 Difference]: With dead ends: 2257 [2025-02-06 03:50:08,543 INFO L226 Difference]: Without dead ends: 1209 [2025-02-06 03:50:08,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:50:08,545 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 136 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:08,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 807 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:50:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-02-06 03:50:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1069. [2025-02-06 03:50:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 908 states have (on average 1.1266519823788546) internal successors, (1023), 918 states have internal predecessors, (1023), 118 states have call successors, (118), 42 states have call predecessors, (118), 42 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-06 03:50:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1259 transitions. [2025-02-06 03:50:08,613 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1259 transitions. Word has length 144 [2025-02-06 03:50:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1259 transitions. [2025-02-06 03:50:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:50:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1259 transitions. [2025-02-06 03:50:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:50:08,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:08,614 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:08,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 03:50:08,615 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -535555287, now seen corresponding path program 1 times [2025-02-06 03:50:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132477644] [2025-02-06 03:50:08,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:08,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:50:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:50:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:50:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132477644] [2025-02-06 03:50:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132477644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:08,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:08,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:50:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982343905] [2025-02-06 03:50:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:08,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:50:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:08,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:50:08,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:50:08,739 INFO L87 Difference]: Start difference. First operand 1069 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:08,917 INFO L93 Difference]: Finished difference Result 2111 states and 2471 transitions. [2025-02-06 03:50:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:50:08,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-02-06 03:50:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:08,922 INFO L225 Difference]: With dead ends: 2111 [2025-02-06 03:50:08,922 INFO L226 Difference]: Without dead ends: 1045 [2025-02-06 03:50:08,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:08,924 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 61 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:08,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 277 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:50:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-02-06 03:50:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1001. [2025-02-06 03:50:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 840 states have (on average 1.0964285714285715) internal successors, (921), 850 states have internal predecessors, (921), 118 states have call successors, (118), 42 states have call predecessors, (118), 42 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-06 03:50:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1157 transitions. [2025-02-06 03:50:08,993 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1157 transitions. Word has length 144 [2025-02-06 03:50:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:08,994 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1157 transitions. [2025-02-06 03:50:08,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:50:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1157 transitions. [2025-02-06 03:50:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:50:08,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:08,995 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:08,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 03:50:08,995 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:08,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash -965727674, now seen corresponding path program 1 times [2025-02-06 03:50:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:08,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636015821] [2025-02-06 03:50:08,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:09,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:50:09,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:50:09,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:09,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat