./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:19:55,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:19:55,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:19:55,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:19:55,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:19:55,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:19:55,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:19:55,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:19:55,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:19:55,276 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:19:55,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:19:55,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:19:55,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:19:55,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:19:55,277 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:19:55,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:19:55,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:19:55,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:19:55,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:19:55,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:19:55,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:19:55,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:19:55,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:19:55,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f [2025-03-17 05:19:55,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:19:55,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:19:55,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:19:55,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:19:55,485 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:19:55,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2025-03-17 05:19:56,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e95379c/e0339cb726364708aa0d47f8c5af1dde/FLAG93bdf6e3b [2025-03-17 05:19:56,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:19:56,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2025-03-17 05:19:56,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e95379c/e0339cb726364708aa0d47f8c5af1dde/FLAG93bdf6e3b [2025-03-17 05:19:57,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e95379c/e0339cb726364708aa0d47f8c5af1dde [2025-03-17 05:19:57,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:19:57,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:19:57,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:19:57,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:19:57,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:19:57,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57, skipping insertion in model container [2025-03-17 05:19:57,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:19:57,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929] [2025-03-17 05:19:57,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:19:57,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:19:57,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929] [2025-03-17 05:19:57,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:19:57,435 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:19:57,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57 WrapperNode [2025-03-17 05:19:57,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:19:57,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:19:57,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:19:57,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:19:57,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,479 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444 [2025-03-17 05:19:57,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:19:57,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:19:57,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:19:57,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:19:57,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,507 INFO L175 MemorySlicer]: Split 123 memory accesses to 4 slices as follows [2, 38, 12, 71]. 58 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 2, 4]. The 14 writes are split as follows [0, 8, 2, 4]. [2025-03-17 05:19:57,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:19:57,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:19:57,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:19:57,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:19:57,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (1/1) ... [2025-03-17 05:19:57,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:19:57,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:19:57,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:19:57,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:19:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:19:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:19:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:19:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:19:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:19:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:19:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:19:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:19:57,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:19:57,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:19:57,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:19:58,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem71#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short106#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short117#1;havoc property_#t~short119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1; [2025-03-17 05:19:58,072 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-17 05:19:58,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:19:58,079 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:19:58,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:19:58,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:19:58 BoogieIcfgContainer [2025-03-17 05:19:58,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:19:58,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:19:58,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:19:58,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:19:58,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:19:57" (1/3) ... [2025-03-17 05:19:58,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb155eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:19:58, skipping insertion in model container [2025-03-17 05:19:58,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:57" (2/3) ... [2025-03-17 05:19:58,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb155eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:19:58, skipping insertion in model container [2025-03-17 05:19:58,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:19:58" (3/3) ... [2025-03-17 05:19:58,088 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-12.i [2025-03-17 05:19:58,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:19:58,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-12.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:19:58,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:19:58,148 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;@1eba2c4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:19:58,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:19:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 states have internal predecessors, (103), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:19:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:19:58,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:58,162 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:19:58,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2126730300, now seen corresponding path program 1 times [2025-03-17 05:19:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:19:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922434734] [2025-03-17 05:19:58,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:19:58,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:19:58,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:19:58,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:58,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:19:58,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:19:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922434734] [2025-03-17 05:19:58,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922434734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:19:58,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011782866] [2025-03-17 05:19:58,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:58,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:19:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:19:58,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:19:58,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:19:58,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:19:58,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:19:58,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:58,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:58,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:19:58,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:19:58,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:19:58,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011782866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:19:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:19:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:19:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796343486] [2025-03-17 05:19:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:19:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:19:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:19:58,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:19:58,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:19:58,592 INFO L87 Difference]: Start difference. First operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 states have internal predecessors, (103), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:19:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:19:58,616 INFO L93 Difference]: Finished difference Result 175 states and 274 transitions. [2025-03-17 05:19:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:19:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2025-03-17 05:19:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:19:58,623 INFO L225 Difference]: With dead ends: 175 [2025-03-17 05:19:58,623 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 05:19:58,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:19:58,627 INFO L435 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:19:58,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:19:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 05:19:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 05:19:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:19:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-03-17 05:19:58,653 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 113 [2025-03-17 05:19:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:19:58,653 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-03-17 05:19:58,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:19:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-03-17 05:19:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:19:58,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:58,656 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:19:58,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:19:58,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:19:58,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:58,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1039840844, now seen corresponding path program 1 times [2025-03-17 05:19:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:19:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032636944] [2025-03-17 05:19:58,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:19:58,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:19:58,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:19:58,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:58,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:19:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:19:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032636944] [2025-03-17 05:19:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032636944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:19:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622609330] [2025-03-17 05:19:59,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:59,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:19:59,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:19:59,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:19:59,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:19:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:19:59,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:19:59,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:59,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:59,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:19:59,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:19:59,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:19:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622609330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:19:59,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:19:59,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:19:59,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343142650] [2025-03-17 05:19:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:19:59,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:19:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:19:59,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:19:59,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:19:59,356 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:19:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:19:59,382 INFO L93 Difference]: Finished difference Result 167 states and 237 transitions. [2025-03-17 05:19:59,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:19:59,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2025-03-17 05:19:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:19:59,386 INFO L225 Difference]: With dead ends: 167 [2025-03-17 05:19:59,386 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 05:19:59,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:19:59,387 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:19:59,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:19:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 05:19:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 05:19:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:19:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-03-17 05:19:59,396 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 113 [2025-03-17 05:19:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:19:59,397 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-03-17 05:19:59,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:19:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-03-17 05:19:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:19:59,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:59,399 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:19:59,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:19:59,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 05:19:59,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:59,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1216963070, now seen corresponding path program 1 times [2025-03-17 05:19:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:19:59,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868432888] [2025-03-17 05:19:59,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:19:59,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:19:59,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:19:59,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:59,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:19:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:19:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868432888] [2025-03-17 05:19:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868432888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:19:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044939306] [2025-03-17 05:19:59,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:19:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:19:59,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:19:59,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:19:59,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:19:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:19:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:59,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:19:59,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:19:59,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:19:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044939306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:19:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:19:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:19:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856803374] [2025-03-17 05:19:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:19:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:19:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:19:59,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:19:59,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:19:59,968 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:00,001 INFO L93 Difference]: Finished difference Result 170 states and 239 transitions. [2025-03-17 05:20:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:00,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2025-03-17 05:20:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:00,005 INFO L225 Difference]: With dead ends: 170 [2025-03-17 05:20:00,005 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:20:00,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:00,006 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:00,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:20:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 05:20:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:20:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-03-17 05:20:00,019 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 115 [2025-03-17 05:20:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:00,019 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-03-17 05:20:00,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-03-17 05:20:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:20:00,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:00,022 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:00,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:20:00,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:00,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:00,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash 730298066, now seen corresponding path program 1 times [2025-03-17 05:20:00,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:00,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374134235] [2025-03-17 05:20:00,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:00,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:00,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:20:00,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:20:00,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:00,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:01,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374134235] [2025-03-17 05:20:01,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374134235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:01,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:01,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:01,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923407527] [2025-03-17 05:20:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:01,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:01,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:01,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:01,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:01,342 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:01,535 INFO L93 Difference]: Finished difference Result 128 states and 172 transitions. [2025-03-17 05:20:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:20:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-03-17 05:20:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:01,537 INFO L225 Difference]: With dead ends: 128 [2025-03-17 05:20:01,537 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 05:20:01,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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-03-17 05:20:01,538 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 35 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:01,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 733 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 05:20:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2025-03-17 05:20:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:20:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 153 transitions. [2025-03-17 05:20:01,551 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 153 transitions. Word has length 117 [2025-03-17 05:20:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:01,552 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 153 transitions. [2025-03-17 05:20:01,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2025-03-17 05:20:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:20:01,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:01,555 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:01,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:20:01,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:01,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash 278222224, now seen corresponding path program 1 times [2025-03-17 05:20:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913878704] [2025-03-17 05:20:01,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:01,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:20:01,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:20:01,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:01,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:20:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913878704] [2025-03-17 05:20:03,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913878704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596532440] [2025-03-17 05:20:03,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:03,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:03,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:03,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:20:03,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:20:03,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:20:03,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:03,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:03,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 05:20:03,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:03,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 05:20:03,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:20:03,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:03,807 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 40 treesize of output 27 [2025-03-17 05:20:04,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:04,192 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 40 treesize of output 36 [2025-03-17 05:20:04,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:04,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 68 treesize of output 34 [2025-03-17 05:20:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:04,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 05:20:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596532440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:20:05,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:20:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 51 [2025-03-17 05:20:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526950073] [2025-03-17 05:20:05,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:20:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 05:20:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:05,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 05:20:05,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2188, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 05:20:05,433 INFO L87 Difference]: Start difference. First operand 112 states and 153 transitions. Second operand has 51 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 44 states have internal predecessors, (132), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-17 05:20:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:07,326 INFO L93 Difference]: Finished difference Result 185 states and 235 transitions. [2025-03-17 05:20:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 05:20:07,326 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 44 states have internal predecessors, (132), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) Word has length 118 [2025-03-17 05:20:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:07,329 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:20:07,329 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 05:20:07,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 207 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1110, Invalid=5210, Unknown=0, NotChecked=0, Total=6320 [2025-03-17 05:20:07,331 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 785 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:07,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1919 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:20:07,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 05:20:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 128. [2025-03-17 05:20:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 106 states have internal predecessors, (133), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:20:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2025-03-17 05:20:07,347 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 118 [2025-03-17 05:20:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:07,348 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2025-03-17 05:20:07,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 44 states have internal predecessors, (132), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-17 05:20:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2025-03-17 05:20:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:20:07,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:07,349 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:07,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:20:07,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:07,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:07,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash -547335141, now seen corresponding path program 1 times [2025-03-17 05:20:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:07,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315324882] [2025-03-17 05:20:07,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:07,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:20:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:20:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:20:08,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315324882] [2025-03-17 05:20:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315324882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660372155] [2025-03-17 05:20:08,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:08,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:08,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:08,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:08,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:20:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:20:09,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:20:09,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:09,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:09,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 05:20:09,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:09,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 05:20:09,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:20:09,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:09,429 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 40 treesize of output 27 [2025-03-17 05:20:09,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:09,726 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 38 treesize of output 36 [2025-03-17 05:20:09,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:09,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 34 [2025-03-17 05:20:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:09,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 05:20:10,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660372155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:20:10,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:20:10,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 26] total 58 [2025-03-17 05:20:10,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910724979] [2025-03-17 05:20:10,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:20:10,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-17 05:20:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:10,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-17 05:20:10,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2866, Unknown=0, NotChecked=0, Total=3306 [2025-03-17 05:20:10,755 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 58 states, 46 states have (on average 3.0217391304347827) internal successors, (139), 51 states have internal predecessors, (139), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-17 05:20:15,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:20:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:17,605 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2025-03-17 05:20:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-17 05:20:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 46 states have (on average 3.0217391304347827) internal successors, (139), 51 states have internal predecessors, (139), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) Word has length 119 [2025-03-17 05:20:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:17,609 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:20:17,609 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 05:20:17,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1547, Invalid=8353, Unknown=0, NotChecked=0, Total=9900 [2025-03-17 05:20:17,611 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 930 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:17,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1914 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1747 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 05:20:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 05:20:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 130. [2025-03-17 05:20:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 108 states have internal predecessors, (136), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:20:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2025-03-17 05:20:17,625 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 119 [2025-03-17 05:20:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:17,625 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2025-03-17 05:20:17,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 46 states have (on average 3.0217391304347827) internal successors, (139), 51 states have internal predecessors, (139), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-17 05:20:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2025-03-17 05:20:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:20:17,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:17,626 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:17,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:20:17,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:17,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:17,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1390575190, now seen corresponding path program 1 times [2025-03-17 05:20:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:17,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691242212] [2025-03-17 05:20:17,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:17,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:17,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:20:17,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:20:17,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:17,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:20:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691242212] [2025-03-17 05:20:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691242212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990769986] [2025-03-17 05:20:18,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:18,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:18,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:18,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:20:18,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:20:18,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:20:18,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:18,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:18,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:20:18,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:18,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 05:20:18,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:18,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2025-03-17 05:20:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 05:20:18,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:20:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990769986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:20:18,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:20:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-17 05:20:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546274855] [2025-03-17 05:20:18,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:20:18,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:20:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:18,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:20:18,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:20:18,540 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 12 states, 9 states have (on average 6.666666666666667) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:20:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:18,896 INFO L93 Difference]: Finished difference Result 267 states and 342 transitions. [2025-03-17 05:20:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:20:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.666666666666667) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 120 [2025-03-17 05:20:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:18,898 INFO L225 Difference]: With dead ends: 267 [2025-03-17 05:20:18,898 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 05:20:18,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:20:18,900 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 205 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:18,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 398 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 05:20:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2025-03-17 05:20:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 111 states have internal predecessors, (138), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:20:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2025-03-17 05:20:18,914 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 120 [2025-03-17 05:20:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2025-03-17 05:20:18,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.666666666666667) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:20:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2025-03-17 05:20:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:20:18,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:18,915 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:18,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 05:20:19,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:19,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:19,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2072675091, now seen corresponding path program 1 times [2025-03-17 05:20:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879989492] [2025-03-17 05:20:19,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:19,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:20:19,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:20:19,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:19,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879989492] [2025-03-17 05:20:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879989492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:19,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60010678] [2025-03-17 05:20:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:19,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:19,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:19,195 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:19,250 INFO L93 Difference]: Finished difference Result 348 states and 432 transitions. [2025-03-17 05:20:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:19,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2025-03-17 05:20:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:19,252 INFO L225 Difference]: With dead ends: 348 [2025-03-17 05:20:19,252 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 05:20:19,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:19,253 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 52 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:19,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 487 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 05:20:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 155. [2025-03-17 05:20:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2272727272727273) internal successors, (162), 132 states have internal predecessors, (162), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:20:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 194 transitions. [2025-03-17 05:20:19,267 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 194 transitions. Word has length 120 [2025-03-17 05:20:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:19,267 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 194 transitions. [2025-03-17 05:20:19,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 194 transitions. [2025-03-17 05:20:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 05:20:19,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:19,268 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:19,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:20:19,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:19,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash -787533963, now seen corresponding path program 1 times [2025-03-17 05:20:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:19,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-03-17 05:20:19,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:19,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:20:19,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:20:19,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:20:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-03-17 05:20:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496099465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445227966] [2025-03-17 05:20:19,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:19,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:19,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:20:19,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:20:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:20:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:19,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:20:19,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:19,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:19,849 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 29 treesize of output 31 [2025-03-17 05:20:19,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:19,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 54 treesize of output 26 [2025-03-17 05:20:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 05:20:19,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:20:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445227966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:20:20,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:20:20,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-17 05:20:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100642184] [2025-03-17 05:20:20,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:20:20,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:20:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:20,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:20:20,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:20:20,161 INFO L87 Difference]: Start difference. First operand 155 states and 194 transitions. Second operand has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:20:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:20,537 INFO L93 Difference]: Finished difference Result 360 states and 448 transitions. [2025-03-17 05:20:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:20:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 121 [2025-03-17 05:20:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:20,541 INFO L225 Difference]: With dead ends: 360 [2025-03-17 05:20:20,541 INFO L226 Difference]: Without dead ends: 206 [2025-03-17 05:20:20,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:20:20,542 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 304 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:20,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 398 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-17 05:20:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 155. [2025-03-17 05:20:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2196969696969697) internal successors, (161), 132 states have internal predecessors, (161), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:20:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2025-03-17 05:20:20,558 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 121 [2025-03-17 05:20:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:20,558 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2025-03-17 05:20:20,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:20:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2025-03-17 05:20:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:20:20,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:20,559 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:20,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 05:20:20,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:20,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:20,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1218390612, now seen corresponding path program 1 times [2025-03-17 05:20:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067397746] [2025-03-17 05:20:20,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:20,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:20:20,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:20:20,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:20,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:20,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283781105] [2025-03-17 05:20:20,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:20,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:20,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:20,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:20,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:20:20,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:20:21,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:20:21,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:21,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:21,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:20:21,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:21,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:20:21,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:20:21,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:20:21,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:21,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 05:20:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:21,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:21,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067397746] [2025-03-17 05:20:21,375 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283781105] [2025-03-17 05:20:21,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283781105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:21,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632054777] [2025-03-17 05:20:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:21,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:21,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:21,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:21,376 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:21,499 INFO L93 Difference]: Finished difference Result 409 states and 505 transitions. [2025-03-17 05:20:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2025-03-17 05:20:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:21,502 INFO L225 Difference]: With dead ends: 409 [2025-03-17 05:20:21,502 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 05:20:21,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:21,502 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 48 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:21,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 308 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 05:20:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 243. [2025-03-17 05:20:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 198 states have (on average 1.1767676767676767) internal successors, (233), 198 states have internal predecessors, (233), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:20:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 297 transitions. [2025-03-17 05:20:21,522 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 297 transitions. Word has length 122 [2025-03-17 05:20:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:21,522 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 297 transitions. [2025-03-17 05:20:21,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 297 transitions. [2025-03-17 05:20:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:20:21,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:21,523 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:21,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 05:20:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 05:20:21,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:21,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 997442743, now seen corresponding path program 1 times [2025-03-17 05:20:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941599702] [2025-03-17 05:20:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:21,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:20:21,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:20:21,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:21,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390373528] [2025-03-17 05:20:21,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:21,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:21,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:21,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 05:20:21,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:20:21,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:20:21,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:21,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:21,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:20:21,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:22,028 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 23 treesize of output 3 [2025-03-17 05:20:22,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:22,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:22,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:22,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 28 [2025-03-17 05:20:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-17 05:20:22,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:22,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:22,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941599702] [2025-03-17 05:20:22,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:22,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390373528] [2025-03-17 05:20:22,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390373528] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:22,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:20:22,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-17 05:20:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389645194] [2025-03-17 05:20:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:22,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:22,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:22,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:22,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:22,408 INFO L87 Difference]: Start difference. First operand 243 states and 297 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:22,712 INFO L93 Difference]: Finished difference Result 629 states and 753 transitions. [2025-03-17 05:20:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2025-03-17 05:20:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:22,715 INFO L225 Difference]: With dead ends: 629 [2025-03-17 05:20:22,715 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 05:20:22,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:22,716 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 90 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:22,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 283 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 05:20:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2025-03-17 05:20:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 306 states have (on average 1.1372549019607843) internal successors, (348), 308 states have internal predecessors, (348), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:20:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 452 transitions. [2025-03-17 05:20:22,745 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 452 transitions. Word has length 123 [2025-03-17 05:20:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:22,746 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 452 transitions. [2025-03-17 05:20:22,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 452 transitions. [2025-03-17 05:20:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:20:22,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:22,748 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:22,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 05:20:22,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:22,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:22,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1292049653, now seen corresponding path program 1 times [2025-03-17 05:20:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547837800] [2025-03-17 05:20:22,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:22,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:20:22,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:20:22,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:22,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:23,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573013149] [2025-03-17 05:20:23,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:23,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:23,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:23,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:23,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 05:20:23,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:20:23,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:20:23,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:23,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:23,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:20:23,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:23,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:20:23,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:20:23,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:20:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:23,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547837800] [2025-03-17 05:20:23,508 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573013149] [2025-03-17 05:20:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573013149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:23,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:20:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930461410] [2025-03-17 05:20:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:23,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:23,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:23,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:23,509 INFO L87 Difference]: Start difference. First operand 383 states and 452 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:23,621 INFO L93 Difference]: Finished difference Result 763 states and 903 transitions. [2025-03-17 05:20:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:23,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-17 05:20:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:23,625 INFO L225 Difference]: With dead ends: 763 [2025-03-17 05:20:23,625 INFO L226 Difference]: Without dead ends: 381 [2025-03-17 05:20:23,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:23,626 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 21 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:23,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 267 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-17 05:20:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2025-03-17 05:20:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 297 states have (on average 1.1313131313131313) internal successors, (336), 299 states have internal predecessors, (336), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:20:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 440 transitions. [2025-03-17 05:20:23,659 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 440 transitions. Word has length 124 [2025-03-17 05:20:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:23,659 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 440 transitions. [2025-03-17 05:20:23,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 440 transitions. [2025-03-17 05:20:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:23,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:23,660 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:23,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 05:20:23,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 05:20:23,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash 193237322, now seen corresponding path program 1 times [2025-03-17 05:20:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-03-17 05:20:23,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:23,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:23,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:23,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:23,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-03-17 05:20:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375609538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848274097] [2025-03-17 05:20:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:24,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:24,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:24,027 INFO L87 Difference]: Start difference. First operand 374 states and 440 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:24,250 INFO L93 Difference]: Finished difference Result 800 states and 953 transitions. [2025-03-17 05:20:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:20:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:24,253 INFO L225 Difference]: With dead ends: 800 [2025-03-17 05:20:24,253 INFO L226 Difference]: Without dead ends: 566 [2025-03-17 05:20:24,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:24,255 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 90 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:24,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 492 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-17 05:20:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 438. [2025-03-17 05:20:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 361 states have (on average 1.1689750692520775) internal successors, (422), 363 states have internal predecessors, (422), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:20:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 526 transitions. [2025-03-17 05:20:24,287 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 526 transitions. Word has length 125 [2025-03-17 05:20:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:24,287 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 526 transitions. [2025-03-17 05:20:24,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 526 transitions. [2025-03-17 05:20:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:24,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:24,289 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:24,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:20:24,290 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:24,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash 260244075, now seen corresponding path program 1 times [2025-03-17 05:20:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570175294] [2025-03-17 05:20:24,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:24,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:24,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:24,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:25,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:25,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570175294] [2025-03-17 05:20:25,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570175294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:25,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:25,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:20:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658479377] [2025-03-17 05:20:25,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:25,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:20:25,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:25,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:20:25,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:20:25,099 INFO L87 Difference]: Start difference. First operand 438 states and 526 transitions. Second operand has 12 states, 9 states have (on average 5.333333333333333) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:25,795 INFO L93 Difference]: Finished difference Result 1044 states and 1270 transitions. [2025-03-17 05:20:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:20:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.333333333333333) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:20:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:25,799 INFO L225 Difference]: With dead ends: 1044 [2025-03-17 05:20:25,799 INFO L226 Difference]: Without dead ends: 746 [2025-03-17 05:20:25,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:20:25,800 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 84 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:25,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 846 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:20:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-17 05:20:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 742. [2025-03-17 05:20:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 612 states have (on average 1.1781045751633987) internal successors, (721), 617 states have internal predecessors, (721), 86 states have call successors, (86), 43 states have call predecessors, (86), 43 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 05:20:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 893 transitions. [2025-03-17 05:20:25,852 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 893 transitions. Word has length 125 [2025-03-17 05:20:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 893 transitions. [2025-03-17 05:20:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.333333333333333) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 893 transitions. [2025-03-17 05:20:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:25,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:25,853 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:25,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:20:25,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:25,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2058531345, now seen corresponding path program 1 times [2025-03-17 05:20:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:25,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648240522] [2025-03-17 05:20:25,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:25,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:25,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:25,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:25,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:27,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:27,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648240522] [2025-03-17 05:20:27,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648240522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:27,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:27,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 05:20:27,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680625531] [2025-03-17 05:20:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:27,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:20:27,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:27,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:20:27,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:20:27,262 INFO L87 Difference]: Start difference. First operand 742 states and 893 transitions. Second operand has 21 states, 17 states have (on average 2.823529411764706) internal successors, (48), 21 states have internal predecessors, (48), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-17 05:20:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:28,962 INFO L93 Difference]: Finished difference Result 1477 states and 1782 transitions. [2025-03-17 05:20:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 05:20:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.823529411764706) internal successors, (48), 21 states have internal predecessors, (48), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) Word has length 125 [2025-03-17 05:20:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:28,968 INFO L225 Difference]: With dead ends: 1477 [2025-03-17 05:20:28,968 INFO L226 Difference]: Without dead ends: 927 [2025-03-17 05:20:28,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:20:28,970 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 231 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:28,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1754 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:20:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-17 05:20:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 809. [2025-03-17 05:20:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 660 states have (on average 1.1681818181818182) internal successors, (771), 666 states have internal predecessors, (771), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 967 transitions. [2025-03-17 05:20:29,033 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 967 transitions. Word has length 125 [2025-03-17 05:20:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:29,033 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 967 transitions. [2025-03-17 05:20:29,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.823529411764706) internal successors, (48), 21 states have internal predecessors, (48), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-17 05:20:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 967 transitions. [2025-03-17 05:20:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:29,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:29,035 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:29,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:20:29,035 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:29,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2039922446, now seen corresponding path program 1 times [2025-03-17 05:20:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:29,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220524550] [2025-03-17 05:20:29,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:29,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:29,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:29,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:29,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220524550] [2025-03-17 05:20:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220524550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:20:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409320608] [2025-03-17 05:20:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:29,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:20:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:29,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:20:29,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:29,327 INFO L87 Difference]: Start difference. First operand 809 states and 967 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:29,699 INFO L93 Difference]: Finished difference Result 1817 states and 2183 transitions. [2025-03-17 05:20:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 125 [2025-03-17 05:20:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:29,705 INFO L225 Difference]: With dead ends: 1817 [2025-03-17 05:20:29,705 INFO L226 Difference]: Without dead ends: 1200 [2025-03-17 05:20:29,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:29,707 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 62 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:29,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 733 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2025-03-17 05:20:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 873. [2025-03-17 05:20:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 724 states have (on average 1.1837016574585635) internal successors, (857), 730 states have internal predecessors, (857), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1053 transitions. [2025-03-17 05:20:29,776 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1053 transitions. Word has length 125 [2025-03-17 05:20:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:29,777 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1053 transitions. [2025-03-17 05:20:29,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1053 transitions. [2025-03-17 05:20:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:29,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:29,779 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:29,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:20:29,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:29,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash 389326794, now seen corresponding path program 1 times [2025-03-17 05:20:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121203527] [2025-03-17 05:20:29,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:29,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:29,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:29,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:29,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121203527] [2025-03-17 05:20:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121203527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:30,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:30,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:20:30,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611728306] [2025-03-17 05:20:30,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:30,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:20:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:30,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:20:30,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:30,440 INFO L87 Difference]: Start difference. First operand 873 states and 1053 transitions. Second operand has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:31,049 INFO L93 Difference]: Finished difference Result 1559 states and 1899 transitions. [2025-03-17 05:20:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:20:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:20:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:31,054 INFO L225 Difference]: With dead ends: 1559 [2025-03-17 05:20:31,054 INFO L226 Difference]: Without dead ends: 878 [2025-03-17 05:20:31,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:20:31,055 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 81 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:31,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 773 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:20:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-17 05:20:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2025-03-17 05:20:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 727 states have (on average 1.1829436038514443) internal successors, (860), 733 states have internal predecessors, (860), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1056 transitions. [2025-03-17 05:20:31,160 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1056 transitions. Word has length 125 [2025-03-17 05:20:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:31,160 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1056 transitions. [2025-03-17 05:20:31,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1056 transitions. [2025-03-17 05:20:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:31,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:31,162 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:31,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:20:31,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:31,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:31,162 INFO L85 PathProgramCache]: Analyzing trace with hash 192813289, now seen corresponding path program 1 times [2025-03-17 05:20:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:31,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583225872] [2025-03-17 05:20:31,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:31,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:31,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:31,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:31,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583225872] [2025-03-17 05:20:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583225872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:31,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:20:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489115591] [2025-03-17 05:20:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:31,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:20:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:31,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:20:31,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:31,684 INFO L87 Difference]: Start difference. First operand 876 states and 1056 transitions. Second operand has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:32,350 INFO L93 Difference]: Finished difference Result 1651 states and 2001 transitions. [2025-03-17 05:20:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:20:32,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:20:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:32,354 INFO L225 Difference]: With dead ends: 1651 [2025-03-17 05:20:32,355 INFO L226 Difference]: Without dead ends: 967 [2025-03-17 05:20:32,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:20:32,356 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 73 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:32,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 810 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:20:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-17 05:20:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 876. [2025-03-17 05:20:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 727 states have (on average 1.1788170563961486) internal successors, (857), 733 states have internal predecessors, (857), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1053 transitions. [2025-03-17 05:20:32,424 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1053 transitions. Word has length 125 [2025-03-17 05:20:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:32,424 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1053 transitions. [2025-03-17 05:20:32,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1053 transitions. [2025-03-17 05:20:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:32,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:32,427 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:20:32,427 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2125962131, now seen corresponding path program 1 times [2025-03-17 05:20:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623939396] [2025-03-17 05:20:32,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:32,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:32,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:32,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:32,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:32,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:32,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623939396] [2025-03-17 05:20:32,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623939396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:32,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:32,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:32,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174507422] [2025-03-17 05:20:32,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:32,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:32,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:32,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:32,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:32,948 INFO L87 Difference]: Start difference. First operand 876 states and 1053 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:33,373 INFO L93 Difference]: Finished difference Result 1547 states and 1869 transitions. [2025-03-17 05:20:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:20:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:20:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:33,379 INFO L225 Difference]: With dead ends: 1547 [2025-03-17 05:20:33,379 INFO L226 Difference]: Without dead ends: 863 [2025-03-17 05:20:33,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:33,381 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 77 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:33,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 739 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-17 05:20:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2025-03-17 05:20:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 712 states have (on average 1.1615168539325842) internal successors, (827), 718 states have internal predecessors, (827), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1023 transitions. [2025-03-17 05:20:33,469 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1023 transitions. Word has length 125 [2025-03-17 05:20:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:33,469 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1023 transitions. [2025-03-17 05:20:33,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1023 transitions. [2025-03-17 05:20:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:33,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:33,470 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:33,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:20:33,471 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash -436916761, now seen corresponding path program 1 times [2025-03-17 05:20:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:33,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597931904] [2025-03-17 05:20:33,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:33,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:33,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:33,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:33,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:34,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:34,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597931904] [2025-03-17 05:20:34,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597931904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:34,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:20:34,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860640979] [2025-03-17 05:20:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:34,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:20:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:34,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:20:34,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:20:34,168 INFO L87 Difference]: Start difference. First operand 861 states and 1023 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:35,010 INFO L93 Difference]: Finished difference Result 1943 states and 2328 transitions. [2025-03-17 05:20:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:20:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:20:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:35,015 INFO L225 Difference]: With dead ends: 1943 [2025-03-17 05:20:35,015 INFO L226 Difference]: Without dead ends: 1274 [2025-03-17 05:20:35,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:20:35,017 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 87 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:35,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1982 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:20:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-03-17 05:20:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 965. [2025-03-17 05:20:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 816 states have (on average 1.1801470588235294) internal successors, (963), 822 states have internal predecessors, (963), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1159 transitions. [2025-03-17 05:20:35,101 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1159 transitions. Word has length 125 [2025-03-17 05:20:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:35,101 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1159 transitions. [2025-03-17 05:20:35,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1159 transitions. [2025-03-17 05:20:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:35,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:35,103 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:35,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:20:35,104 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:35,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -633430266, now seen corresponding path program 1 times [2025-03-17 05:20:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:35,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181378490] [2025-03-17 05:20:35,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:35,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:35,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:35,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:35,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181378490] [2025-03-17 05:20:35,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181378490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:35,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:35,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:35,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268243230] [2025-03-17 05:20:35,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:35,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:35,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:35,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:35,668 INFO L87 Difference]: Start difference. First operand 965 states and 1159 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:35,987 INFO L93 Difference]: Finished difference Result 1740 states and 2105 transitions. [2025-03-17 05:20:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:20:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:20:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:35,990 INFO L225 Difference]: With dead ends: 1740 [2025-03-17 05:20:35,991 INFO L226 Difference]: Without dead ends: 967 [2025-03-17 05:20:35,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:35,992 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:35,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 741 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-17 05:20:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2025-03-17 05:20:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 816 states have (on average 1.1727941176470589) internal successors, (957), 822 states have internal predecessors, (957), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1153 transitions. [2025-03-17 05:20:36,066 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1153 transitions. Word has length 125 [2025-03-17 05:20:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:36,067 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1153 transitions. [2025-03-17 05:20:36,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1153 transitions. [2025-03-17 05:20:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:36,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:36,068 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:36,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:20:36,068 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:36,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1539275115, now seen corresponding path program 1 times [2025-03-17 05:20:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:36,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942912151] [2025-03-17 05:20:36,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:36,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:36,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:36,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:36,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:36,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942912151] [2025-03-17 05:20:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942912151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:20:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081097381] [2025-03-17 05:20:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:20:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:36,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:20:36,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:20:36,896 INFO L87 Difference]: Start difference. First operand 965 states and 1153 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:37,629 INFO L93 Difference]: Finished difference Result 1819 states and 2183 transitions. [2025-03-17 05:20:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:20:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:20:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:37,633 INFO L225 Difference]: With dead ends: 1819 [2025-03-17 05:20:37,633 INFO L226 Difference]: Without dead ends: 1046 [2025-03-17 05:20:37,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:20:37,636 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 76 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:37,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1015 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:20:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-17 05:20:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 959. [2025-03-17 05:20:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 810 states have (on average 1.1666666666666667) internal successors, (945), 816 states have internal predecessors, (945), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1141 transitions. [2025-03-17 05:20:37,765 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1141 transitions. Word has length 125 [2025-03-17 05:20:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:37,765 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1141 transitions. [2025-03-17 05:20:37,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1141 transitions. [2025-03-17 05:20:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:37,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:37,767 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:37,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:20:37,767 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:37,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash -503923514, now seen corresponding path program 1 times [2025-03-17 05:20:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:37,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54319507] [2025-03-17 05:20:37,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:37,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:37,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:37,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54319507] [2025-03-17 05:20:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54319507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:37,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270205126] [2025-03-17 05:20:37,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:37,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:37,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:37,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:37,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:37,925 INFO L87 Difference]: Start difference. First operand 959 states and 1141 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:38,183 INFO L93 Difference]: Finished difference Result 1674 states and 2006 transitions. [2025-03-17 05:20:38,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:20:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:38,186 INFO L225 Difference]: With dead ends: 1674 [2025-03-17 05:20:38,186 INFO L226 Difference]: Without dead ends: 907 [2025-03-17 05:20:38,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:38,188 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 85 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:38,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 506 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-17 05:20:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2025-03-17 05:20:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 756 states have (on average 1.1653439153439153) internal successors, (881), 762 states have internal predecessors, (881), 98 states have call successors, (98), 50 states have call predecessors, (98), 50 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 05:20:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1077 transitions. [2025-03-17 05:20:38,267 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1077 transitions. Word has length 125 [2025-03-17 05:20:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:38,267 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1077 transitions. [2025-03-17 05:20:38,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1077 transitions. [2025-03-17 05:20:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:38,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:38,269 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:38,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:20:38,269 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:38,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:38,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2094518291, now seen corresponding path program 1 times [2025-03-17 05:20:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030211818] [2025-03-17 05:20:38,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:38,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:38,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:38,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:38,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030211818] [2025-03-17 05:20:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030211818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:38,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812643829] [2025-03-17 05:20:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:38,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:38,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:38,735 INFO L87 Difference]: Start difference. First operand 905 states and 1077 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:39,160 INFO L93 Difference]: Finished difference Result 1672 states and 1982 transitions. [2025-03-17 05:20:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:20:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:20:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:39,163 INFO L225 Difference]: With dead ends: 1672 [2025-03-17 05:20:39,164 INFO L226 Difference]: Without dead ends: 959 [2025-03-17 05:20:39,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:39,165 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 79 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:39,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 715 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-17 05:20:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 712. [2025-03-17 05:20:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 597 states have (on average 1.150753768844221) internal successors, (687), 601 states have internal predecessors, (687), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 839 transitions. [2025-03-17 05:20:39,236 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 839 transitions. Word has length 125 [2025-03-17 05:20:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:39,236 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 839 transitions. [2025-03-17 05:20:39,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:20:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 839 transitions. [2025-03-17 05:20:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:39,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:39,237 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:39,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:20:39,238 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 353339848, now seen corresponding path program 1 times [2025-03-17 05:20:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533418380] [2025-03-17 05:20:39,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:39,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:39,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:39,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:39,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533418380] [2025-03-17 05:20:39,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533418380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:39,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:39,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:39,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244660331] [2025-03-17 05:20:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:39,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:39,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:39,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:39,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:39,453 INFO L87 Difference]: Start difference. First operand 712 states and 839 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:39,768 INFO L93 Difference]: Finished difference Result 1364 states and 1615 transitions. [2025-03-17 05:20:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:20:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:39,772 INFO L225 Difference]: With dead ends: 1364 [2025-03-17 05:20:39,772 INFO L226 Difference]: Without dead ends: 844 [2025-03-17 05:20:39,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-17 05:20:39,773 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:39,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 490 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-17 05:20:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 674. [2025-03-17 05:20:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 559 states have (on average 1.1288014311270125) internal successors, (631), 563 states have internal predecessors, (631), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 783 transitions. [2025-03-17 05:20:39,848 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 783 transitions. Word has length 125 [2025-03-17 05:20:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 783 transitions. [2025-03-17 05:20:39,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 783 transitions. [2025-03-17 05:20:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:39,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:39,850 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:39,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:20:39,850 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:39,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash 156826343, now seen corresponding path program 1 times [2025-03-17 05:20:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237589349] [2025-03-17 05:20:39,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:39,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:39,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:39,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:39,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237589349] [2025-03-17 05:20:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237589349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:40,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:20:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036123758] [2025-03-17 05:20:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:40,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:20:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:40,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:20:40,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:40,303 INFO L87 Difference]: Start difference. First operand 674 states and 783 transitions. Second operand has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:40,808 INFO L93 Difference]: Finished difference Result 1285 states and 1505 transitions. [2025-03-17 05:20:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:20:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:20:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:40,811 INFO L225 Difference]: With dead ends: 1285 [2025-03-17 05:20:40,811 INFO L226 Difference]: Without dead ends: 803 [2025-03-17 05:20:40,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:20:40,812 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 72 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:40,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 916 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:20:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-17 05:20:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 709. [2025-03-17 05:20:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 594 states have (on average 1.1313131313131313) internal successors, (672), 598 states have internal predecessors, (672), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 824 transitions. [2025-03-17 05:20:40,869 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 824 transitions. Word has length 125 [2025-03-17 05:20:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 824 transitions. [2025-03-17 05:20:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 824 transitions. [2025-03-17 05:20:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:40,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:40,870 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:40,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:20:40,870 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1965435572, now seen corresponding path program 1 times [2025-03-17 05:20:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900925966] [2025-03-17 05:20:40,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:40,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:40,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:40,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:40,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:41,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900925966] [2025-03-17 05:20:41,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900925966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:41,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:41,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:20:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102865050] [2025-03-17 05:20:41,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:41,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:20:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:41,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:20:41,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:41,156 INFO L87 Difference]: Start difference. First operand 709 states and 824 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:41,441 INFO L93 Difference]: Finished difference Result 1358 states and 1585 transitions. [2025-03-17 05:20:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 125 [2025-03-17 05:20:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:41,445 INFO L225 Difference]: With dead ends: 1358 [2025-03-17 05:20:41,445 INFO L226 Difference]: Without dead ends: 841 [2025-03-17 05:20:41,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:41,446 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 61 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:41,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 560 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-17 05:20:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 709. [2025-03-17 05:20:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 594 states have (on average 1.121212121212121) internal successors, (666), 598 states have internal predecessors, (666), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 818 transitions. [2025-03-17 05:20:41,507 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 818 transitions. Word has length 125 [2025-03-17 05:20:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:41,509 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 818 transitions. [2025-03-17 05:20:41,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 818 transitions. [2025-03-17 05:20:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:41,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:41,510 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:41,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:20:41,510 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2133018219, now seen corresponding path program 1 times [2025-03-17 05:20:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542869479] [2025-03-17 05:20:41,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:41,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:41,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:41,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:41,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542869479] [2025-03-17 05:20:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542869479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:43,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:43,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 05:20:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923820595] [2025-03-17 05:20:43,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:20:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:43,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:20:43,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:20:43,250 INFO L87 Difference]: Start difference. First operand 709 states and 818 transitions. Second operand has 21 states, 17 states have (on average 2.823529411764706) internal successors, (48), 21 states have internal predecessors, (48), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-17 05:20:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:45,035 INFO L93 Difference]: Finished difference Result 1365 states and 1579 transitions. [2025-03-17 05:20:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 05:20:45,036 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.823529411764706) internal successors, (48), 21 states have internal predecessors, (48), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) Word has length 125 [2025-03-17 05:20:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:45,041 INFO L225 Difference]: With dead ends: 1365 [2025-03-17 05:20:45,041 INFO L226 Difference]: Without dead ends: 848 [2025-03-17 05:20:45,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:20:45,042 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 68 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:45,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2482 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:20:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-17 05:20:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 748. [2025-03-17 05:20:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 633 states have (on average 1.1232227488151658) internal successors, (711), 637 states have internal predecessors, (711), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 863 transitions. [2025-03-17 05:20:45,126 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 863 transitions. Word has length 125 [2025-03-17 05:20:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:45,126 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 863 transitions. [2025-03-17 05:20:45,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.823529411764706) internal successors, (48), 21 states have internal predecessors, (48), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-17 05:20:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 863 transitions. [2025-03-17 05:20:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:45,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:45,127 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:20:45,127 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:45,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2094942324, now seen corresponding path program 1 times [2025-03-17 05:20:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337093837] [2025-03-17 05:20:45,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:45,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:45,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:45,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337093837] [2025-03-17 05:20:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337093837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603407141] [2025-03-17 05:20:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:45,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:45,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:45,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:45,322 INFO L87 Difference]: Start difference. First operand 748 states and 863 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:45,591 INFO L93 Difference]: Finished difference Result 1404 states and 1619 transitions. [2025-03-17 05:20:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 125 [2025-03-17 05:20:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:45,595 INFO L225 Difference]: With dead ends: 1404 [2025-03-17 05:20:45,595 INFO L226 Difference]: Without dead ends: 848 [2025-03-17 05:20:45,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-03-17 05:20:45,596 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 87 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:45,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 547 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-17 05:20:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 712. [2025-03-17 05:20:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 597 states have (on average 1.11892797319933) internal successors, (668), 601 states have internal predecessors, (668), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 820 transitions. [2025-03-17 05:20:45,660 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 820 transitions. Word has length 125 [2025-03-17 05:20:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:45,661 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 820 transitions. [2025-03-17 05:20:45,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 820 transitions. [2025-03-17 05:20:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:45,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:45,662 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:45,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:20:45,662 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:45,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:45,662 INFO L85 PathProgramCache]: Analyzing trace with hash -473327740, now seen corresponding path program 1 times [2025-03-17 05:20:45,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:45,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333003713] [2025-03-17 05:20:45,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:45,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:45,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:45,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:45,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:45,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:45,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333003713] [2025-03-17 05:20:45,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333003713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:45,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:45,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:45,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137658724] [2025-03-17 05:20:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:45,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:45,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:45,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:45,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:45,810 INFO L87 Difference]: Start difference. First operand 712 states and 820 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:45,945 INFO L93 Difference]: Finished difference Result 1172 states and 1354 transitions. [2025-03-17 05:20:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:20:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:45,948 INFO L225 Difference]: With dead ends: 1172 [2025-03-17 05:20:45,948 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 05:20:45,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:45,948 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:45,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 05:20:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2025-03-17 05:20:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 537 states have (on average 1.1080074487895717) internal successors, (595), 541 states have internal predecessors, (595), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 747 transitions. [2025-03-17 05:20:46,007 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 747 transitions. Word has length 125 [2025-03-17 05:20:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:46,007 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 747 transitions. [2025-03-17 05:20:46,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 747 transitions. [2025-03-17 05:20:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:46,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:46,008 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:46,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:20:46,008 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:46,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -540334493, now seen corresponding path program 1 times [2025-03-17 05:20:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458469932] [2025-03-17 05:20:46,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:46,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:46,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:46,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:46,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:47,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458469932] [2025-03-17 05:20:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458469932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 05:20:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332363325] [2025-03-17 05:20:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:47,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:20:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:47,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:20:47,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:20:47,227 INFO L87 Difference]: Start difference. First operand 652 states and 747 transitions. Second operand has 20 states, 17 states have (on average 2.823529411764706) internal successors, (48), 20 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:48,754 INFO L93 Difference]: Finished difference Result 1189 states and 1363 transitions. [2025-03-17 05:20:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 05:20:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.823529411764706) internal successors, (48), 20 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:20:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:48,757 INFO L225 Difference]: With dead ends: 1189 [2025-03-17 05:20:48,757 INFO L226 Difference]: Without dead ends: 729 [2025-03-17 05:20:48,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:20:48,759 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 89 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:48,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 2081 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:20:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-17 05:20:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 655. [2025-03-17 05:20:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 540 states have (on average 1.1074074074074074) internal successors, (598), 544 states have internal predecessors, (598), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 750 transitions. [2025-03-17 05:20:48,823 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 750 transitions. Word has length 125 [2025-03-17 05:20:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:48,823 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 750 transitions. [2025-03-17 05:20:48,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.823529411764706) internal successors, (48), 20 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 750 transitions. [2025-03-17 05:20:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:20:48,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:48,824 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:48,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:20:48,824 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1435857383, now seen corresponding path program 1 times [2025-03-17 05:20:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653717861] [2025-03-17 05:20:48,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:48,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:20:48,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:20:48,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:49,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653717861] [2025-03-17 05:20:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653717861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:20:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509212380] [2025-03-17 05:20:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:20:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:49,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:20:49,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:49,326 INFO L87 Difference]: Start difference. First operand 655 states and 750 transitions. Second operand has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:49,831 INFO L93 Difference]: Finished difference Result 1156 states and 1324 transitions. [2025-03-17 05:20:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:20:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:20:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:49,834 INFO L225 Difference]: With dead ends: 1156 [2025-03-17 05:20:49,834 INFO L226 Difference]: Without dead ends: 693 [2025-03-17 05:20:49,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:20:49,835 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 69 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:49,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1184 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:20:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-17 05:20:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 637. [2025-03-17 05:20:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 522 states have (on average 1.0996168582375478) internal successors, (574), 526 states have internal predecessors, (574), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 726 transitions. [2025-03-17 05:20:49,913 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 726 transitions. Word has length 125 [2025-03-17 05:20:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:49,913 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 726 transitions. [2025-03-17 05:20:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:20:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 726 transitions. [2025-03-17 05:20:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:20:49,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:49,914 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:49,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:20:49,914 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1256000598, now seen corresponding path program 1 times [2025-03-17 05:20:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803497745] [2025-03-17 05:20:49,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:49,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:20:49,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:20:49,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:49,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803497745] [2025-03-17 05:20:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803497745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748383607] [2025-03-17 05:20:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:49,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:49,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:49,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:49,975 INFO L87 Difference]: Start difference. First operand 637 states and 726 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:50,088 INFO L93 Difference]: Finished difference Result 1126 states and 1282 transitions. [2025-03-17 05:20:50,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:50,088 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2025-03-17 05:20:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:50,091 INFO L225 Difference]: With dead ends: 1126 [2025-03-17 05:20:50,091 INFO L226 Difference]: Without dead ends: 681 [2025-03-17 05:20:50,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:50,092 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 63 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:50,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 451 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-17 05:20:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 637. [2025-03-17 05:20:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 522 states have (on average 1.0766283524904214) internal successors, (562), 526 states have internal predecessors, (562), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 714 transitions. [2025-03-17 05:20:50,159 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 714 transitions. Word has length 127 [2025-03-17 05:20:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:50,159 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 714 transitions. [2025-03-17 05:20:50,159 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 714 transitions. [2025-03-17 05:20:50,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:20:50,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:50,160 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:50,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:20:50,160 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:50,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1845045587, now seen corresponding path program 1 times [2025-03-17 05:20:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:50,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777175123] [2025-03-17 05:20:50,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:50,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:20:50,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:20:50,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:50,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:50,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060563622] [2025-03-17 05:20:50,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:50,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:50,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:50,213 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:50,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 05:20:50,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:20:50,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:20:50,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:50,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:50,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:20:50,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:50,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 05:20:50,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:50,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:50,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:50,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:50,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 77 treesize of output 35 [2025-03-17 05:20:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:50,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777175123] [2025-03-17 05:20:50,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060563622] [2025-03-17 05:20:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060563622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:50,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:50,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361760475] [2025-03-17 05:20:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:50,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:50,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:50,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:50,983 INFO L87 Difference]: Start difference. First operand 637 states and 714 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:51,577 INFO L93 Difference]: Finished difference Result 1248 states and 1397 transitions. [2025-03-17 05:20:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:51,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-03-17 05:20:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:51,580 INFO L225 Difference]: With dead ends: 1248 [2025-03-17 05:20:51,580 INFO L226 Difference]: Without dead ends: 789 [2025-03-17 05:20:51,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:51,582 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 64 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:51,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 635 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:20:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-17 05:20:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 618. [2025-03-17 05:20:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 503 states have (on average 1.0715705765407555) internal successors, (539), 507 states have internal predecessors, (539), 76 states have call successors, (76), 38 states have call predecessors, (76), 38 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 691 transitions. [2025-03-17 05:20:51,651 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 691 transitions. Word has length 132 [2025-03-17 05:20:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:51,652 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 691 transitions. [2025-03-17 05:20:51,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 691 transitions. [2025-03-17 05:20:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:20:51,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:51,652 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:51,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 05:20:51,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-17 05:20:51,853 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:51,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash -292909779, now seen corresponding path program 1 times [2025-03-17 05:20:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679797673] [2025-03-17 05:20:51,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:51,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:20:51,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:20:51,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:51,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-17 05:20:52,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679797673] [2025-03-17 05:20:52,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679797673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475303922] [2025-03-17 05:20:52,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:52,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:52,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:52,259 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:52,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 05:20:52,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:20:52,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:20:52,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:52,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:52,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 05:20:52,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:52,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:52,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2025-03-17 05:20:52,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:52,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:20:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:20:52,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-17 05:20:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475303922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:20:53,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:20:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2025-03-17 05:20:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000187651] [2025-03-17 05:20:53,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:20:53,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 05:20:53,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:53,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 05:20:53,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:20:53,072 INFO L87 Difference]: Start difference. First operand 618 states and 691 transitions. Second operand has 28 states, 22 states have (on average 4.454545454545454) internal successors, (98), 26 states have internal predecessors, (98), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) [2025-03-17 05:20:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:53,907 INFO L93 Difference]: Finished difference Result 1041 states and 1158 transitions. [2025-03-17 05:20:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:20:53,908 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 4.454545454545454) internal successors, (98), 26 states have internal predecessors, (98), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) Word has length 132 [2025-03-17 05:20:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:53,910 INFO L225 Difference]: With dead ends: 1041 [2025-03-17 05:20:53,910 INFO L226 Difference]: Without dead ends: 615 [2025-03-17 05:20:53,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1447, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:20:53,912 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 428 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:53,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 575 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:20:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-17 05:20:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 591. [2025-03-17 05:20:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 472 states have (on average 1.0677966101694916) internal successors, (504), 476 states have internal predecessors, (504), 76 states have call successors, (76), 42 states have call predecessors, (76), 42 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:20:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 656 transitions. [2025-03-17 05:20:53,985 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 656 transitions. Word has length 132 [2025-03-17 05:20:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 656 transitions. [2025-03-17 05:20:53,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 4.454545454545454) internal successors, (98), 26 states have internal predecessors, (98), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) [2025-03-17 05:20:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 656 transitions. [2025-03-17 05:20:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:20:53,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:53,986 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:53,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 05:20:54,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-17 05:20:54,187 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:54,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash 240568813, now seen corresponding path program 1 times [2025-03-17 05:20:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:54,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132694124] [2025-03-17 05:20:54,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:54,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:20:54,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:20:54,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:54,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:54,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646479323] [2025-03-17 05:20:54,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:54,251 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:54,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 05:20:54,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:20:54,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:20:54,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:54,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:54,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 05:20:54,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:54,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:54,837 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 28 [2025-03-17 05:20:54,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:54,889 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 38 treesize of output 16 [2025-03-17 05:20:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:20:54,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2025-03-17 05:20:55,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:55,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 26 [2025-03-17 05:20:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-17 05:20:55,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132694124] [2025-03-17 05:20:55,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646479323] [2025-03-17 05:20:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646479323] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:20:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2025-03-17 05:20:55,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830623144] [2025-03-17 05:20:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:55,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:55,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:20:55,351 INFO L87 Difference]: Start difference. First operand 591 states and 656 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:55,753 INFO L93 Difference]: Finished difference Result 1238 states and 1369 transitions. [2025-03-17 05:20:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:55,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-03-17 05:20:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:55,757 INFO L225 Difference]: With dead ends: 1238 [2025-03-17 05:20:55,757 INFO L226 Difference]: Without dead ends: 700 [2025-03-17 05:20:55,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:55,758 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 58 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:55,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 438 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-17 05:20:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 486. [2025-03-17 05:20:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 397 states have (on average 1.057934508816121) internal successors, (420), 399 states have internal predecessors, (420), 56 states have call successors, (56), 32 states have call predecessors, (56), 32 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:20:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 532 transitions. [2025-03-17 05:20:55,827 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 532 transitions. Word has length 132 [2025-03-17 05:20:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:55,827 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 532 transitions. [2025-03-17 05:20:55,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 532 transitions. [2025-03-17 05:20:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:20:55,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:55,828 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:55,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 05:20:56,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-17 05:20:56,029 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:56,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash -776737042, now seen corresponding path program 1 times [2025-03-17 05:20:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:56,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669438447] [2025-03-17 05:20:56,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:56,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:20:56,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:20:56,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:56,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118712695] [2025-03-17 05:20:56,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:56,076 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:56,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 05:20:56,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:20:56,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:20:56,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:56,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:56,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:20:56,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:56,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:56,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 28 [2025-03-17 05:20:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:56,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:56,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669438447] [2025-03-17 05:20:56,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118712695] [2025-03-17 05:20:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118712695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:56,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:56,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:56,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704686762] [2025-03-17 05:20:56,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:56,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:56,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:56,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:56,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:56,368 INFO L87 Difference]: Start difference. First operand 486 states and 532 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:56,725 INFO L93 Difference]: Finished difference Result 967 states and 1057 transitions. [2025-03-17 05:20:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:56,726 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-17 05:20:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:56,728 INFO L225 Difference]: With dead ends: 967 [2025-03-17 05:20:56,728 INFO L226 Difference]: Without dead ends: 636 [2025-03-17 05:20:56,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:56,730 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 50 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:56,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 462 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-17 05:20:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 486. [2025-03-17 05:20:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 397 states have (on average 1.0528967254408061) internal successors, (418), 399 states have internal predecessors, (418), 56 states have call successors, (56), 32 states have call predecessors, (56), 32 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:20:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 530 transitions. [2025-03-17 05:20:56,806 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 530 transitions. Word has length 134 [2025-03-17 05:20:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:56,806 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 530 transitions. [2025-03-17 05:20:56,806 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 530 transitions. [2025-03-17 05:20:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:20:56,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:56,807 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:56,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 05:20:57,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:57,008 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:57,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1269255286, now seen corresponding path program 1 times [2025-03-17 05:20:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:57,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721237719] [2025-03-17 05:20:57,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:57,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:57,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:20:57,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:20:57,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:57,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:57,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068851023] [2025-03-17 05:20:57,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:57,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:57,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:57,064 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:57,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 05:20:57,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:20:57,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:20:57,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:57,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:57,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:20:57,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:57,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:20:57,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:57,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 28 [2025-03-17 05:20:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:57,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721237719] [2025-03-17 05:20:57,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068851023] [2025-03-17 05:20:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068851023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:57,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:57,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244197236] [2025-03-17 05:20:57,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:57,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:57,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:57,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:57,497 INFO L87 Difference]: Start difference. First operand 486 states and 530 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:57,893 INFO L93 Difference]: Finished difference Result 909 states and 991 transitions. [2025-03-17 05:20:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:57,893 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-17 05:20:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:57,896 INFO L225 Difference]: With dead ends: 909 [2025-03-17 05:20:57,896 INFO L226 Difference]: Without dead ends: 578 [2025-03-17 05:20:57,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:57,897 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 56 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:57,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 589 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-17 05:20:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 486. [2025-03-17 05:20:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 397 states have (on average 1.0478589420654911) internal successors, (416), 399 states have internal predecessors, (416), 56 states have call successors, (56), 32 states have call predecessors, (56), 32 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:20:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 528 transitions. [2025-03-17 05:20:57,968 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 528 transitions. Word has length 134 [2025-03-17 05:20:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:57,968 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 528 transitions. [2025-03-17 05:20:57,968 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:20:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 528 transitions. [2025-03-17 05:20:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:20:57,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:57,969 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:57,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 05:20:58,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-17 05:20:58,170 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:58,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:58,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1065281646, now seen corresponding path program 1 times [2025-03-17 05:20:58,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:58,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935472908] [2025-03-17 05:20:58,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:58,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:20:58,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:20:58,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:58,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:58,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:58,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935472908] [2025-03-17 05:20:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935472908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:58,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:20:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440676704] [2025-03-17 05:20:58,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:58,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:20:58,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:58,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:20:58,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:20:58,991 INFO L87 Difference]: Start difference. First operand 486 states and 528 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:59,474 INFO L93 Difference]: Finished difference Result 573 states and 619 transitions. [2025-03-17 05:20:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:20:59,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2025-03-17 05:20:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:59,477 INFO L225 Difference]: With dead ends: 573 [2025-03-17 05:20:59,477 INFO L226 Difference]: Without dead ends: 571 [2025-03-17 05:20:59,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:20:59,477 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 29 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:59,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1485 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-17 05:20:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 541. [2025-03-17 05:20:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 452 states have (on average 1.0464601769911503) internal successors, (473), 454 states have internal predecessors, (473), 56 states have call successors, (56), 32 states have call predecessors, (56), 32 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:20:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 585 transitions. [2025-03-17 05:20:59,548 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 585 transitions. Word has length 138 [2025-03-17 05:20:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:59,548 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 585 transitions. [2025-03-17 05:20:59,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:20:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 585 transitions. [2025-03-17 05:20:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:20:59,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:59,549 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:59,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 05:20:59,549 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:59,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1422231187, now seen corresponding path program 1 times [2025-03-17 05:20:59,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:59,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081771185] [2025-03-17 05:20:59,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:59,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:20:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:20:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:20:59,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:59,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081771185] [2025-03-17 05:20:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081771185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:59,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391484259] [2025-03-17 05:20:59,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:59,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:59,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:59,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:59,839 INFO L87 Difference]: Start difference. First operand 541 states and 585 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:00,004 INFO L93 Difference]: Finished difference Result 965 states and 1039 transitions. [2025-03-17 05:21:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:00,005 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2025-03-17 05:21:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:00,007 INFO L225 Difference]: With dead ends: 965 [2025-03-17 05:21:00,007 INFO L226 Difference]: Without dead ends: 579 [2025-03-17 05:21:00,007 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-03-17 05:21:00,008 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 23 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:00,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 543 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-17 05:21:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 541. [2025-03-17 05:21:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 452 states have (on average 1.0420353982300885) internal successors, (471), 454 states have internal predecessors, (471), 56 states have call successors, (56), 32 states have call predecessors, (56), 32 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:21:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 583 transitions. [2025-03-17 05:21:00,077 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 583 transitions. Word has length 138 [2025-03-17 05:21:00,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:00,077 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 583 transitions. [2025-03-17 05:21:00,077 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 583 transitions. [2025-03-17 05:21:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:21:00,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:00,078 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:00,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:21:00,078 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:00,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1053965519, now seen corresponding path program 1 times [2025-03-17 05:21:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124827729] [2025-03-17 05:21:00,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:00,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:21:00,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:21:00,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:00,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:21:00,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124827729] [2025-03-17 05:21:00,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124827729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:00,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:00,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516942632] [2025-03-17 05:21:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:00,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:00,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:00,352 INFO L87 Difference]: Start difference. First operand 541 states and 583 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:00,505 INFO L93 Difference]: Finished difference Result 955 states and 1025 transitions. [2025-03-17 05:21:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:00,506 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2025-03-17 05:21:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:00,508 INFO L225 Difference]: With dead ends: 955 [2025-03-17 05:21:00,508 INFO L226 Difference]: Without dead ends: 569 [2025-03-17 05:21:00,509 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-03-17 05:21:00,509 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 45 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:00,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 486 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-17 05:21:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 541. [2025-03-17 05:21:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 452 states have (on average 1.0376106194690264) internal successors, (469), 454 states have internal predecessors, (469), 56 states have call successors, (56), 32 states have call predecessors, (56), 32 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:21:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 581 transitions. [2025-03-17 05:21:00,581 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 581 transitions. Word has length 138 [2025-03-17 05:21:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:00,581 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 581 transitions. [2025-03-17 05:21:00,581 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 581 transitions. [2025-03-17 05:21:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:21:00,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:00,582 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:00,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 05:21:00,582 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:00,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1433547314, now seen corresponding path program 1 times [2025-03-17 05:21:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009252330] [2025-03-17 05:21:00,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:00,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:21:00,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:21:00,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:21:00,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009252330] [2025-03-17 05:21:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009252330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:21:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701447430] [2025-03-17 05:21:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:21:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:00,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:21:00,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:21:00,930 INFO L87 Difference]: Start difference. First operand 541 states and 581 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:01,321 INFO L93 Difference]: Finished difference Result 707 states and 772 transitions. [2025-03-17 05:21:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:21:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-17 05:21:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:01,323 INFO L225 Difference]: With dead ends: 707 [2025-03-17 05:21:01,323 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:21:01,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:21:01,324 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 84 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:01,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1966 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:21:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:21:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:21:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 05:21:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:21:01,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2025-03-17 05:21:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:01,325 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:21:01,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:21:01,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:21:01,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:21:01,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 05:21:01,335 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:01,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.