./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.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 a45c2430f9ee77637d939805617689caafff3a773f20a4396b37c0a4bb861fb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:55:53,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:55:53,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:55:53,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:55:53,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:55:53,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:55:53,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:55:53,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:55:53,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:55:53,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:55:53,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:55:53,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:55:53,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:55:53,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:55:53,905 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:55:53,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:55:53,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:55:53,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:55:53,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:55:53,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:55:53,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:55:53,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:55:53,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:55:53,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:55:53,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:55:53,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:55:53,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:55:53,908 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 -> a45c2430f9ee77637d939805617689caafff3a773f20a4396b37c0a4bb861fb3 [2025-03-08 16:55:54,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:55:54,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:55:54,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:55:54,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:55:54,129 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:55:54,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i [2025-03-08 16:55:55,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7838a5572/f0b7430d94624547bc8cd877a6d207d5/FLAGc7f72102d [2025-03-08 16:55:55,513 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:55:55,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i [2025-03-08 16:55:55,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7838a5572/f0b7430d94624547bc8cd877a6d207d5/FLAGc7f72102d [2025-03-08 16:55:55,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7838a5572/f0b7430d94624547bc8cd877a6d207d5 [2025-03-08 16:55:55,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:55:55,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:55:55,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:55:55,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:55:55,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:55:55,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:55:55" (1/1) ... [2025-03-08 16:55:55,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6626b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:55, skipping insertion in model container [2025-03-08 16:55:55,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:55:55" (1/1) ... [2025-03-08 16:55:55,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:55:55,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i[916,929] [2025-03-08 16:55:56,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:55:56,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:55:56,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i[916,929] [2025-03-08 16:55:56,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:55:56,089 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:55:56,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56 WrapperNode [2025-03-08 16:55:56,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:55:56,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:55:56,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:55:56,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:55:56,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,154 INFO L138 Inliner]: procedures = 27, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-03-08 16:55:56,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:55:56,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:55:56,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:55:56,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:55:56,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,190 INFO L175 MemorySlicer]: Split 140 memory accesses to 2 slices as follows [2, 138]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2025-03-08 16:55:56,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:55:56,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:55:56,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:55:56,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:55:56,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (1/1) ... [2025-03-08 16:55:56,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:55:56,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:55:56,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:55:56,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:55:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:55:56,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:55:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:55:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:55:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:55:56,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:55:56,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:55:56,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:55:56,732 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem80#1;havoc property_#t~ite93#1;havoc property_#t~mem86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem101#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short111#1;havoc property_#t~mem117#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite141#1;havoc property_#t~mem133#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-08 16:55:56,765 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-08 16:55:56,765 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:55:56,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:55:56,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:55:56,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:55:56 BoogieIcfgContainer [2025-03-08 16:55:56,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:55:56,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:55:56,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:55:56,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:55:56,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:55:55" (1/3) ... [2025-03-08 16:55:56,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d717ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:55:56, skipping insertion in model container [2025-03-08 16:55:56,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:56" (2/3) ... [2025-03-08 16:55:56,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d717ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:55:56, skipping insertion in model container [2025-03-08 16:55:56,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:55:56" (3/3) ... [2025-03-08 16:55:56,785 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-85.i [2025-03-08 16:55:56,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:55:56,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-85.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:55:56,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:55:56,850 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;@4f787331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:55:56,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:55:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:55:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 16:55:56,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:56,869 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:55:56,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash -316871689, now seen corresponding path program 1 times [2025-03-08 16:55:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:55:56,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359206347] [2025-03-08 16:55:56,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:55:56,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:55:57,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:55:57,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:57,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 16:55:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:55:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359206347] [2025-03-08 16:55:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359206347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:55:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849135972] [2025-03-08 16:55:57,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:57,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:55:57,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:55:57,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:55:57,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:55:57,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:55:57,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:55:57,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:57,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:57,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:55:57,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 16:55:57,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849135972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:57,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:55:57,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:55:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900758114] [2025-03-08 16:55:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:57,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:55:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:55:57,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:55:57,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:55:57,420 INFO L87 Difference]: Start difference. First operand has 130 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:55:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:57,442 INFO L93 Difference]: Finished difference Result 254 states and 396 transitions. [2025-03-08 16:55:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:55:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2025-03-08 16:55:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:57,449 INFO L225 Difference]: With dead ends: 254 [2025-03-08 16:55:57,449 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 16:55:57,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:55:57,453 INFO L435 NwaCegarLoop]: 184 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, 184 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:57,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:55:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 16:55:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 16:55:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:55:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2025-03-08 16:55:57,486 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2025-03-08 16:55:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:57,486 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2025-03-08 16:55:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:55:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2025-03-08 16:55:57,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 16:55:57,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:57,489 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:55:57,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:55:57,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:55:57,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:57,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -247117376, now seen corresponding path program 1 times [2025-03-08 16:55:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:55:57,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069118098] [2025-03-08 16:55:57,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:55:57,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:55:57,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:55:57,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:57,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:55:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:55:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069118098] [2025-03-08 16:55:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069118098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:58,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:55:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584456546] [2025-03-08 16:55:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:58,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:55:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:55:58,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:55:58,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:55:58,050 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:55:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:58,079 INFO L93 Difference]: Finished difference Result 254 states and 369 transitions. [2025-03-08 16:55:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:55:58,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-03-08 16:55:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:58,081 INFO L225 Difference]: With dead ends: 254 [2025-03-08 16:55:58,081 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 16:55:58,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:55:58,082 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:58,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:55:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 16:55:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-03-08 16:55:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:55:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-03-08 16:55:58,090 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 179 [2025-03-08 16:55:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:58,091 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-03-08 16:55:58,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:55:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-03-08 16:55:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 16:55:58,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:58,093 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:55:58,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:55:58,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:58,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash -235801249, now seen corresponding path program 1 times [2025-03-08 16:55:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:55:58,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121399179] [2025-03-08 16:55:58,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:55:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:55:58,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:55:58,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:58,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121399179] [2025-03-08 16:56:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121399179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:00,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:56:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290593425] [2025-03-08 16:56:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:00,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:56:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:00,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:56:00,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:56:00,467 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:01,217 INFO L93 Difference]: Finished difference Result 472 states and 679 transitions. [2025-03-08 16:56:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:56:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2025-03-08 16:56:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:01,220 INFO L225 Difference]: With dead ends: 472 [2025-03-08 16:56:01,222 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 16:56:01,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:56:01,223 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 266 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:01,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 639 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:56:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 16:56:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 199. [2025-03-08 16:56:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.3859649122807018) internal successors, (237), 172 states have internal predecessors, (237), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 287 transitions. [2025-03-08 16:56:01,238 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 287 transitions. Word has length 179 [2025-03-08 16:56:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:01,239 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 287 transitions. [2025-03-08 16:56:01,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 287 transitions. [2025-03-08 16:56:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:01,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:01,241 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:56:01,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1687427436, now seen corresponding path program 1 times [2025-03-08 16:56:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956404037] [2025-03-08 16:56:01,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:01,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:01,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:01,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:01,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:02,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956404037] [2025-03-08 16:56:02,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956404037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872836565] [2025-03-08 16:56:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:02,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:02,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:02,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:02,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:02,501 INFO L87 Difference]: Start difference. First operand 199 states and 287 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:02,937 INFO L93 Difference]: Finished difference Result 575 states and 831 transitions. [2025-03-08 16:56:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:56:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-08 16:56:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:02,943 INFO L225 Difference]: With dead ends: 575 [2025-03-08 16:56:02,943 INFO L226 Difference]: Without dead ends: 379 [2025-03-08 16:56:02,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:02,944 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 253 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:02,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 659 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:56:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-08 16:56:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 203. [2025-03-08 16:56:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 176 states have internal predecessors, (241), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2025-03-08 16:56:02,968 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 180 [2025-03-08 16:56:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:02,969 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2025-03-08 16:56:02,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2025-03-08 16:56:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:02,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:02,970 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:56:02,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1796165136, now seen corresponding path program 1 times [2025-03-08 16:56:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879230955] [2025-03-08 16:56:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:02,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:03,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:03,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:03,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879230955] [2025-03-08 16:56:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879230955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:03,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:56:03,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744653609] [2025-03-08 16:56:03,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:03,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:56:03,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:03,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:56:03,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:03,611 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:04,259 INFO L93 Difference]: Finished difference Result 804 states and 1154 transitions. [2025-03-08 16:56:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:56:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:56:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:04,263 INFO L225 Difference]: With dead ends: 804 [2025-03-08 16:56:04,264 INFO L226 Difference]: Without dead ends: 604 [2025-03-08 16:56:04,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:56:04,266 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 305 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:04,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1191 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:56:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-08 16:56:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 251. [2025-03-08 16:56:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 223 states have (on average 1.390134529147982) internal successors, (310), 224 states have internal predecessors, (310), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 360 transitions. [2025-03-08 16:56:04,287 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 360 transitions. Word has length 180 [2025-03-08 16:56:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:04,288 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 360 transitions. [2025-03-08 16:56:04,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 360 transitions. [2025-03-08 16:56:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:04,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:04,289 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:04,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:56:04,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:04,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1988267983, now seen corresponding path program 1 times [2025-03-08 16:56:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:04,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173281431] [2025-03-08 16:56:04,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:04,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:04,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:04,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:04,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:04,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173281431] [2025-03-08 16:56:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173281431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:04,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:56:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289039373] [2025-03-08 16:56:04,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:04,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:56:04,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:04,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:56:04,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:56:04,625 INFO L87 Difference]: Start difference. First operand 251 states and 360 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:04,893 INFO L93 Difference]: Finished difference Result 661 states and 948 transitions. [2025-03-08 16:56:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:04,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:56:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:04,896 INFO L225 Difference]: With dead ends: 661 [2025-03-08 16:56:04,896 INFO L226 Difference]: Without dead ends: 413 [2025-03-08 16:56:04,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-08 16:56:04,898 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 150 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:04,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 694 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-08 16:56:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 289. [2025-03-08 16:56:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.3946360153256705) internal successors, (364), 262 states have internal predecessors, (364), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 414 transitions. [2025-03-08 16:56:04,915 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 414 transitions. Word has length 180 [2025-03-08 16:56:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:04,916 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 414 transitions. [2025-03-08 16:56:04,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 414 transitions. [2025-03-08 16:56:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:04,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:04,918 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:56:04,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1654330289, now seen corresponding path program 1 times [2025-03-08 16:56:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821367936] [2025-03-08 16:56:04,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:04,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:04,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821367936] [2025-03-08 16:56:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821367936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:05,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:56:05,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316791279] [2025-03-08 16:56:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:05,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:56:05,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:05,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:56:05,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:56:05,207 INFO L87 Difference]: Start difference. First operand 289 states and 414 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:05,470 INFO L93 Difference]: Finished difference Result 699 states and 998 transitions. [2025-03-08 16:56:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:05,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:56:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:05,472 INFO L225 Difference]: With dead ends: 699 [2025-03-08 16:56:05,472 INFO L226 Difference]: Without dead ends: 413 [2025-03-08 16:56:05,473 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-08 16:56:05,473 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 152 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:05,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 698 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-08 16:56:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 289. [2025-03-08 16:56:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 262 states have internal predecessors, (360), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 410 transitions. [2025-03-08 16:56:05,489 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 410 transitions. Word has length 180 [2025-03-08 16:56:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:05,491 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 410 transitions. [2025-03-08 16:56:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 410 transitions. [2025-03-08 16:56:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:05,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:05,494 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:05,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:56:05,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:05,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 956918571, now seen corresponding path program 1 times [2025-03-08 16:56:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684869299] [2025-03-08 16:56:05,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:05,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:05,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:05,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:05,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684869299] [2025-03-08 16:56:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684869299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:56:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719563768] [2025-03-08 16:56:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:56:06,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:56:06,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:56:06,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:06,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:06,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:06,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:06,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 16:56:06,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:06,472 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 13 treesize of output 9 [2025-03-08 16:56:06,500 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 48 treesize of output 34 [2025-03-08 16:56:06,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2025-03-08 16:56:06,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-03-08 16:56:06,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:06,605 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 59 treesize of output 34 [2025-03-08 16:56:06,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:06,625 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 59 treesize of output 34 [2025-03-08 16:56:06,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:06,658 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 59 treesize of output 52 [2025-03-08 16:56:06,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:06,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 73 [2025-03-08 16:56:06,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:06,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 34 [2025-03-08 16:56:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:07,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:56:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719563768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:07,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:56:07,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2025-03-08 16:56:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241472015] [2025-03-08 16:56:07,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:07,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:56:07,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:07,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:56:07,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:56:07,024 INFO L87 Difference]: Start difference. First operand 289 states and 410 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:07,875 INFO L93 Difference]: Finished difference Result 1006 states and 1416 transitions. [2025-03-08 16:56:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:56:07,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:56:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:07,882 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 16:56:07,882 INFO L226 Difference]: Without dead ends: 720 [2025-03-08 16:56:07,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:56:07,883 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 381 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:07,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1432 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:56:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-08 16:56:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 315. [2025-03-08 16:56:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 287 states have (on average 1.3832752613240418) internal successors, (397), 288 states have internal predecessors, (397), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 447 transitions. [2025-03-08 16:56:07,899 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 447 transitions. Word has length 180 [2025-03-08 16:56:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:07,899 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 447 transitions. [2025-03-08 16:56:07,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 447 transitions. [2025-03-08 16:56:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:07,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:07,901 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:07,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:56:08,106 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,SelfDestructingSolverStorable7 [2025-03-08 16:56:08,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 446384394, now seen corresponding path program 1 times [2025-03-08 16:56:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:08,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129574948] [2025-03-08 16:56:08,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:08,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:08,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:08,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:08,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:08,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:08,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129574948] [2025-03-08 16:56:08,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129574948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:08,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:08,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:56:08,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341629121] [2025-03-08 16:56:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:08,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:56:08,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:08,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:56:08,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:56:08,581 INFO L87 Difference]: Start difference. First operand 315 states and 447 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:09,171 INFO L93 Difference]: Finished difference Result 990 states and 1407 transitions. [2025-03-08 16:56:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:56:09,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:56:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:09,176 INFO L225 Difference]: With dead ends: 990 [2025-03-08 16:56:09,177 INFO L226 Difference]: Without dead ends: 678 [2025-03-08 16:56:09,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:56:09,179 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 373 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:09,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 840 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:56:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-08 16:56:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 329. [2025-03-08 16:56:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 301 states have (on average 1.3820598006644518) internal successors, (416), 302 states have internal predecessors, (416), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 466 transitions. [2025-03-08 16:56:09,202 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 466 transitions. Word has length 180 [2025-03-08 16:56:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:09,203 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 466 transitions. [2025-03-08 16:56:09,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 466 transitions. [2025-03-08 16:56:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:09,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:09,205 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:56:09,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1768293295, now seen corresponding path program 1 times [2025-03-08 16:56:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589992116] [2025-03-08 16:56:09,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:09,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:09,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:09,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:09,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589992116] [2025-03-08 16:56:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589992116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:10,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:10,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:56:10,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449863159] [2025-03-08 16:56:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:10,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:56:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:10,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:56:10,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:56:10,099 INFO L87 Difference]: Start difference. First operand 329 states and 466 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:10,632 INFO L93 Difference]: Finished difference Result 920 states and 1304 transitions. [2025-03-08 16:56:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:56:10,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-08 16:56:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:10,635 INFO L225 Difference]: With dead ends: 920 [2025-03-08 16:56:10,635 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 16:56:10,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:56:10,636 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 458 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:10,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 501 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:56:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 16:56:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 337. [2025-03-08 16:56:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 309 states have (on average 1.3786407766990292) internal successors, (426), 310 states have internal predecessors, (426), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2025-03-08 16:56:10,664 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 180 [2025-03-08 16:56:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:10,664 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2025-03-08 16:56:10,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2025-03-08 16:56:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:10,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:10,666 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:10,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:56:10,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash 548094346, now seen corresponding path program 1 times [2025-03-08 16:56:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:10,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370871189] [2025-03-08 16:56:10,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:10,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:10,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:10,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:10,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:11,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:11,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370871189] [2025-03-08 16:56:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370871189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:11,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:56:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383502150] [2025-03-08 16:56:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:56:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:56:11,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:56:11,117 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:11,727 INFO L93 Difference]: Finished difference Result 1021 states and 1444 transitions. [2025-03-08 16:56:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:56:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:56:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:11,730 INFO L225 Difference]: With dead ends: 1021 [2025-03-08 16:56:11,731 INFO L226 Difference]: Without dead ends: 687 [2025-03-08 16:56:11,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:56:11,732 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 298 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:11,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 956 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:56:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-08 16:56:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 351. [2025-03-08 16:56:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 323 states have (on average 1.3715170278637772) internal successors, (443), 324 states have internal predecessors, (443), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 493 transitions. [2025-03-08 16:56:11,748 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 493 transitions. Word has length 180 [2025-03-08 16:56:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:11,749 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 493 transitions. [2025-03-08 16:56:11,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 493 transitions. [2025-03-08 16:56:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:56:11,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:11,751 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:11,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:56:11,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:11,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 37560169, now seen corresponding path program 1 times [2025-03-08 16:56:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:11,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60072611] [2025-03-08 16:56:11,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:11,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:11,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:11,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:11,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:12,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60072611] [2025-03-08 16:56:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60072611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:56:12,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717864705] [2025-03-08 16:56:12,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:56:12,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:56:12,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:56:12,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:56:12,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:56:12,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:12,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:12,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:56:12,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:12,473 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 11 treesize of output 9 [2025-03-08 16:56:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:12,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:56:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717864705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:12,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:56:12,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 16:56:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120829407] [2025-03-08 16:56:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:12,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:56:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:12,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:56:12,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:56:12,531 INFO L87 Difference]: Start difference. First operand 351 states and 493 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:12,870 INFO L93 Difference]: Finished difference Result 1007 states and 1424 transitions. [2025-03-08 16:56:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:56:12,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:56:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:12,873 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 16:56:12,873 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 16:56:12,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:56:12,874 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 162 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:12,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1496 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 16:56:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 366. [2025-03-08 16:56:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 338 states have (on average 1.3698224852071006) internal successors, (463), 339 states have internal predecessors, (463), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 513 transitions. [2025-03-08 16:56:12,886 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 513 transitions. Word has length 180 [2025-03-08 16:56:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:12,886 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 513 transitions. [2025-03-08 16:56:12,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 513 transitions. [2025-03-08 16:56:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:56:12,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:12,888 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:12,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:56:13,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:13,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:13,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1771306245, now seen corresponding path program 1 times [2025-03-08 16:56:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004128756] [2025-03-08 16:56:13,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:13,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:56:13,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:56:13,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:13,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:13,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:13,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004128756] [2025-03-08 16:56:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004128756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:13,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:13,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231558389] [2025-03-08 16:56:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:13,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:13,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:13,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:13,451 INFO L87 Difference]: Start difference. First operand 366 states and 513 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:13,832 INFO L93 Difference]: Finished difference Result 904 states and 1266 transitions. [2025-03-08 16:56:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-08 16:56:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:13,835 INFO L225 Difference]: With dead ends: 904 [2025-03-08 16:56:13,835 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 16:56:13,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:13,837 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 294 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:13,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 510 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 16:56:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 360. [2025-03-08 16:56:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 332 states have (on average 1.3704819277108433) internal successors, (455), 333 states have internal predecessors, (455), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 505 transitions. [2025-03-08 16:56:13,852 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 505 transitions. Word has length 181 [2025-03-08 16:56:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 505 transitions. [2025-03-08 16:56:13,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 505 transitions. [2025-03-08 16:56:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:56:13,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:13,854 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:13,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:56:13,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:13,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1437368551, now seen corresponding path program 1 times [2025-03-08 16:56:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:13,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578231104] [2025-03-08 16:56:13,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:13,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:56:13,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:56:13,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:13,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:14,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:14,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578231104] [2025-03-08 16:56:14,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578231104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:14,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:14,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837871984] [2025-03-08 16:56:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:14,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:14,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:14,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:14,241 INFO L87 Difference]: Start difference. First operand 360 states and 505 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:14,637 INFO L93 Difference]: Finished difference Result 885 states and 1244 transitions. [2025-03-08 16:56:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:14,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-08 16:56:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:14,640 INFO L225 Difference]: With dead ends: 885 [2025-03-08 16:56:14,640 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 16:56:14,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:14,643 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 470 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:14,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 284 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:56:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 16:56:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 362. [2025-03-08 16:56:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 334 states have (on average 1.3682634730538923) internal successors, (457), 335 states have internal predecessors, (457), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 507 transitions. [2025-03-08 16:56:14,658 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 507 transitions. Word has length 181 [2025-03-08 16:56:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:14,658 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 507 transitions. [2025-03-08 16:56:14,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 507 transitions. [2025-03-08 16:56:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:56:14,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:14,661 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:14,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:56:14,661 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:14,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash 926834374, now seen corresponding path program 1 times [2025-03-08 16:56:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:14,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743339767] [2025-03-08 16:56:14,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:14,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:56:14,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:56:14,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:15,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:15,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743339767] [2025-03-08 16:56:15,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743339767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:15,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:15,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:56:15,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876950526] [2025-03-08 16:56:15,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:15,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:56:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:15,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:56:15,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:15,115 INFO L87 Difference]: Start difference. First operand 362 states and 507 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:15,778 INFO L93 Difference]: Finished difference Result 1100 states and 1547 transitions. [2025-03-08 16:56:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:56:15,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-08 16:56:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:15,781 INFO L225 Difference]: With dead ends: 1100 [2025-03-08 16:56:15,781 INFO L226 Difference]: Without dead ends: 741 [2025-03-08 16:56:15,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:56:15,785 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 299 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:15,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1632 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:56:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-08 16:56:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 365. [2025-03-08 16:56:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 337 states have (on average 1.3649851632047478) internal successors, (460), 338 states have internal predecessors, (460), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 510 transitions. [2025-03-08 16:56:15,807 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 510 transitions. Word has length 181 [2025-03-08 16:56:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:15,807 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 510 transitions. [2025-03-08 16:56:15,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 510 transitions. [2025-03-08 16:56:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:56:15,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:15,810 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:15,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:56:15,810 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:15,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash 447465662, now seen corresponding path program 1 times [2025-03-08 16:56:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:15,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393437931] [2025-03-08 16:56:15,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:15,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:56:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:56:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:16,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393437931] [2025-03-08 16:56:16,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393437931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:56:16,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982870080] [2025-03-08 16:56:16,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:16,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:16,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:56:16,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:56:16,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:56:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:56:16,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:56:16,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:16,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:16,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 16:56:16,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:16,573 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 13 treesize of output 9 [2025-03-08 16:56:16,590 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 48 treesize of output 34 [2025-03-08 16:56:16,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2025-03-08 16:56:16,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 25 [2025-03-08 16:56:16,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:16,647 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 59 treesize of output 34 [2025-03-08 16:56:16,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:16,659 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 59 treesize of output 34 [2025-03-08 16:56:16,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:16,684 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 59 treesize of output 34 [2025-03-08 16:56:16,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:16,740 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 65 treesize of output 52 [2025-03-08 16:56:16,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:16,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 31 [2025-03-08 16:56:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:16,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:56:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982870080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:16,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:56:16,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2025-03-08 16:56:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251347445] [2025-03-08 16:56:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:16,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:56:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:16,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:56:16,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:56:16,900 INFO L87 Difference]: Start difference. First operand 365 states and 510 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:17,733 INFO L93 Difference]: Finished difference Result 1082 states and 1517 transitions. [2025-03-08 16:56:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:56:17,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-08 16:56:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:17,736 INFO L225 Difference]: With dead ends: 1082 [2025-03-08 16:56:17,736 INFO L226 Difference]: Without dead ends: 720 [2025-03-08 16:56:17,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:56:17,737 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 403 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:17,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1406 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:56:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-08 16:56:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 358. [2025-03-08 16:56:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 500 transitions. [2025-03-08 16:56:17,753 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 500 transitions. Word has length 181 [2025-03-08 16:56:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:17,753 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 500 transitions. [2025-03-08 16:56:17,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 500 transitions. [2025-03-08 16:56:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:56:17,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:17,754 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:17,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 16:56:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 16:56:17,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1258840386, now seen corresponding path program 1 times [2025-03-08 16:56:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:17,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939248166] [2025-03-08 16:56:17,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:17,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:56:17,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:56:17,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:17,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:18,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939248166] [2025-03-08 16:56:18,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939248166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:18,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:18,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588699977] [2025-03-08 16:56:18,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:18,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:18,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:18,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:18,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:18,675 INFO L87 Difference]: Start difference. First operand 358 states and 500 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:19,021 INFO L93 Difference]: Finished difference Result 939 states and 1324 transitions. [2025-03-08 16:56:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:56:19,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 181 [2025-03-08 16:56:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:19,024 INFO L225 Difference]: With dead ends: 939 [2025-03-08 16:56:19,024 INFO L226 Difference]: Without dead ends: 584 [2025-03-08 16:56:19,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:19,026 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 259 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:19,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 527 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-08 16:56:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 321. [2025-03-08 16:56:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 293 states have (on average 1.3378839590443685) internal successors, (392), 294 states have internal predecessors, (392), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 442 transitions. [2025-03-08 16:56:19,043 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 442 transitions. Word has length 181 [2025-03-08 16:56:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 442 transitions. [2025-03-08 16:56:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 442 transitions. [2025-03-08 16:56:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 16:56:19,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:19,044 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:56:19,045 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:19,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash -271126962, now seen corresponding path program 1 times [2025-03-08 16:56:19,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:19,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349159312] [2025-03-08 16:56:19,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:19,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 16:56:19,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 16:56:19,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:19,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349159312] [2025-03-08 16:56:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349159312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:19,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:19,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:56:19,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471856754] [2025-03-08 16:56:19,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:19,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:56:19,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:19,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:56:19,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:56:19,148 INFO L87 Difference]: Start difference. First operand 321 states and 442 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:19,333 INFO L93 Difference]: Finished difference Result 898 states and 1237 transitions. [2025-03-08 16:56:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:56:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-03-08 16:56:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:19,335 INFO L225 Difference]: With dead ends: 898 [2025-03-08 16:56:19,335 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 16:56:19,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:19,336 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 93 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:19,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 471 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 16:56:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 323. [2025-03-08 16:56:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 295 states have (on average 1.3389830508474576) internal successors, (395), 296 states have internal predecessors, (395), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 445 transitions. [2025-03-08 16:56:19,348 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 445 transitions. Word has length 182 [2025-03-08 16:56:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:19,349 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 445 transitions. [2025-03-08 16:56:19,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 445 transitions. [2025-03-08 16:56:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 16:56:19,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:19,350 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:19,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:56:19,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:19,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1679173293, now seen corresponding path program 1 times [2025-03-08 16:56:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945898790] [2025-03-08 16:56:19,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:19,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 16:56:19,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 16:56:19,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:19,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:19,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:19,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945898790] [2025-03-08 16:56:19,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945898790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:19,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:19,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:56:19,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661580956] [2025-03-08 16:56:19,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:19,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:56:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:19,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:56:19,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:19,440 INFO L87 Difference]: Start difference. First operand 323 states and 445 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:19,515 INFO L93 Difference]: Finished difference Result 553 states and 763 transitions. [2025-03-08 16:56:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:56:19,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-03-08 16:56:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:19,516 INFO L225 Difference]: With dead ends: 553 [2025-03-08 16:56:19,517 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 16:56:19,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:19,517 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:19,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 450 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:56:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 16:56:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2025-03-08 16:56:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 205 states have internal predecessors, (268), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 318 transitions. [2025-03-08 16:56:19,528 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 318 transitions. Word has length 182 [2025-03-08 16:56:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:19,529 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 318 transitions. [2025-03-08 16:56:19,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 318 transitions. [2025-03-08 16:56:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 16:56:19,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:19,530 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:19,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:56:19,530 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:19,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1135589110, now seen corresponding path program 1 times [2025-03-08 16:56:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:19,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229298084] [2025-03-08 16:56:19,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:19,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 16:56:19,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 16:56:19,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:19,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:20,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229298084] [2025-03-08 16:56:20,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229298084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:20,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:20,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:20,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48739588] [2025-03-08 16:56:20,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:20,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:20,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:20,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:20,351 INFO L87 Difference]: Start difference. First operand 232 states and 318 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:20,567 INFO L93 Difference]: Finished difference Result 631 states and 865 transitions. [2025-03-08 16:56:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:20,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 183 [2025-03-08 16:56:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:20,569 INFO L225 Difference]: With dead ends: 631 [2025-03-08 16:56:20,569 INFO L226 Difference]: Without dead ends: 402 [2025-03-08 16:56:20,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-08 16:56:20,570 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 72 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:20,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 553 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-08 16:56:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 328. [2025-03-08 16:56:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 300 states have (on average 1.31) internal successors, (393), 301 states have internal predecessors, (393), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 443 transitions. [2025-03-08 16:56:20,588 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 443 transitions. Word has length 183 [2025-03-08 16:56:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:20,588 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 443 transitions. [2025-03-08 16:56:20,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 443 transitions. [2025-03-08 16:56:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 16:56:20,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:20,589 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:20,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:56:20,589 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:20,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1651826377, now seen corresponding path program 1 times [2025-03-08 16:56:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996990180] [2025-03-08 16:56:20,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:20,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 16:56:20,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 16:56:20,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:20,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996990180] [2025-03-08 16:56:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996990180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:56:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613863556] [2025-03-08 16:56:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:56:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:21,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:56:21,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:21,005 INFO L87 Difference]: Start difference. First operand 328 states and 443 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:21,284 INFO L93 Difference]: Finished difference Result 717 states and 972 transitions. [2025-03-08 16:56:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:56:21,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2025-03-08 16:56:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:21,287 INFO L225 Difference]: With dead ends: 717 [2025-03-08 16:56:21,287 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 16:56:21,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:56:21,288 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 148 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:21,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1114 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 16:56:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 334. [2025-03-08 16:56:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 306 states have (on average 1.303921568627451) internal successors, (399), 307 states have internal predecessors, (399), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 449 transitions. [2025-03-08 16:56:21,303 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 449 transitions. Word has length 183 [2025-03-08 16:56:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:21,303 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 449 transitions. [2025-03-08 16:56:21,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 449 transitions. [2025-03-08 16:56:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 16:56:21,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:21,304 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:21,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:56:21,305 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:21,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1858935751, now seen corresponding path program 1 times [2025-03-08 16:56:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:21,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820624970] [2025-03-08 16:56:21,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:21,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 16:56:21,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 16:56:21,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:21,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820624970] [2025-03-08 16:56:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820624970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:21,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:21,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:56:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955909337] [2025-03-08 16:56:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:21,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:56:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:21,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:56:21,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:56:21,419 INFO L87 Difference]: Start difference. First operand 334 states and 449 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:21,597 INFO L93 Difference]: Finished difference Result 745 states and 1006 transitions. [2025-03-08 16:56:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:56:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-03-08 16:56:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:21,600 INFO L225 Difference]: With dead ends: 745 [2025-03-08 16:56:21,600 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 16:56:21,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:21,602 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 51 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:21,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 519 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 16:56:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 338. [2025-03-08 16:56:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 310 states have (on average 1.3064516129032258) internal successors, (405), 311 states have internal predecessors, (405), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 455 transitions. [2025-03-08 16:56:21,618 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 455 transitions. Word has length 185 [2025-03-08 16:56:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:21,618 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 455 transitions. [2025-03-08 16:56:21,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 455 transitions. [2025-03-08 16:56:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 16:56:21,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:21,619 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:21,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:56:21,620 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:21,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash -351383942, now seen corresponding path program 1 times [2025-03-08 16:56:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080870517] [2025-03-08 16:56:21,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:21,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 16:56:21,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 16:56:21,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:21,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:21,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080870517] [2025-03-08 16:56:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080870517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:21,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:56:21,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343111326] [2025-03-08 16:56:21,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:56:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:21,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:56:21,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:21,741 INFO L87 Difference]: Start difference. First operand 338 states and 455 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:21,832 INFO L93 Difference]: Finished difference Result 661 states and 891 transitions. [2025-03-08 16:56:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:56:21,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-03-08 16:56:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:21,836 INFO L225 Difference]: With dead ends: 661 [2025-03-08 16:56:21,836 INFO L226 Difference]: Without dead ends: 326 [2025-03-08 16:56:21,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:21,837 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:21,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:56:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-08 16:56:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2025-03-08 16:56:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 296 states have (on average 1.2939189189189189) internal successors, (383), 297 states have internal predecessors, (383), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 433 transitions. [2025-03-08 16:56:21,871 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 433 transitions. Word has length 185 [2025-03-08 16:56:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:21,871 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 433 transitions. [2025-03-08 16:56:21,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 433 transitions. [2025-03-08 16:56:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 16:56:21,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:21,872 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:21,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:56:21,873 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:21,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash -796293168, now seen corresponding path program 1 times [2025-03-08 16:56:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475508988] [2025-03-08 16:56:21,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:21,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 16:56:21,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 16:56:21,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:21,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475508988] [2025-03-08 16:56:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475508988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:21,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:56:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807543448] [2025-03-08 16:56:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:21,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:56:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:21,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:56:21,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:21,960 INFO L87 Difference]: Start difference. First operand 324 states and 433 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:21,981 INFO L93 Difference]: Finished difference Result 651 states and 871 transitions. [2025-03-08 16:56:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:56:21,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-08 16:56:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:21,983 INFO L225 Difference]: With dead ends: 651 [2025-03-08 16:56:21,983 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 16:56:21,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:21,983 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:21,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:56:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 16:56:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-03-08 16:56:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 300 states have (on average 1.29) internal successors, (387), 301 states have internal predecessors, (387), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 437 transitions. [2025-03-08 16:56:21,998 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 437 transitions. Word has length 187 [2025-03-08 16:56:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:21,998 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 437 transitions. [2025-03-08 16:56:21,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 437 transitions. [2025-03-08 16:56:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 16:56:21,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:21,999 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:56:22,000 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:22,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash -667210449, now seen corresponding path program 1 times [2025-03-08 16:56:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:22,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476798335] [2025-03-08 16:56:22,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:22,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 16:56:22,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 16:56:22,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:22,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:22,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:22,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476798335] [2025-03-08 16:56:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476798335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:22,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:56:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163279343] [2025-03-08 16:56:22,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:56:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:56:22,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:56:22,655 INFO L87 Difference]: Start difference. First operand 328 states and 437 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:23,023 INFO L93 Difference]: Finished difference Result 884 states and 1165 transitions. [2025-03-08 16:56:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:56:23,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-08 16:56:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:23,026 INFO L225 Difference]: With dead ends: 884 [2025-03-08 16:56:23,026 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 16:56:23,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:56:23,027 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 146 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:23,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1396 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 16:56:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 424. [2025-03-08 16:56:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 396 states have (on average 1.25) internal successors, (495), 397 states have internal predecessors, (495), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:56:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 545 transitions. [2025-03-08 16:56:23,041 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 545 transitions. Word has length 187 [2025-03-08 16:56:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:23,042 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 545 transitions. [2025-03-08 16:56:23,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 545 transitions. [2025-03-08 16:56:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 16:56:23,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:23,043 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:23,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:56:23,043 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:23,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1235523385, now seen corresponding path program 1 times [2025-03-08 16:56:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:23,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847300015] [2025-03-08 16:56:23,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:23,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 16:56:23,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 16:56:23,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:23,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847300015] [2025-03-08 16:56:24,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847300015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:24,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:24,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593506331] [2025-03-08 16:56:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:24,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:24,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:24,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:24,101 INFO L87 Difference]: Start difference. First operand 424 states and 545 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:24,341 INFO L93 Difference]: Finished difference Result 930 states and 1189 transitions. [2025-03-08 16:56:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2025-03-08 16:56:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:24,343 INFO L225 Difference]: With dead ends: 930 [2025-03-08 16:56:24,343 INFO L226 Difference]: Without dead ends: 509 [2025-03-08 16:56:24,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-08 16:56:24,346 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 137 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:24,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 621 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-08 16:56:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 328. [2025-03-08 16:56:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 302 states have internal predecessors, (377), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:56:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2025-03-08 16:56:24,360 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 188 [2025-03-08 16:56:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:24,361 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2025-03-08 16:56:24,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2025-03-08 16:56:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 16:56:24,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:24,362 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:24,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:56:24,364 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:24,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1330419854, now seen corresponding path program 1 times [2025-03-08 16:56:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:24,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916201436] [2025-03-08 16:56:24,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:24,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 16:56:24,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 16:56:24,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:24,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:25,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:25,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916201436] [2025-03-08 16:56:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916201436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:25,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:25,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:25,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439149935] [2025-03-08 16:56:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:25,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:25,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:25,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:25,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:25,352 INFO L87 Difference]: Start difference. First operand 328 states and 423 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:25,639 INFO L93 Difference]: Finished difference Result 688 states and 887 transitions. [2025-03-08 16:56:25,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:25,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2025-03-08 16:56:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:25,641 INFO L225 Difference]: With dead ends: 688 [2025-03-08 16:56:25,641 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 16:56:25,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-08 16:56:25,642 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 60 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:25,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 622 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 16:56:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 328. [2025-03-08 16:56:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 302 states have (on average 1.2450331125827814) internal successors, (376), 302 states have internal predecessors, (376), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:56:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 422 transitions. [2025-03-08 16:56:25,655 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 422 transitions. Word has length 189 [2025-03-08 16:56:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:25,655 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 422 transitions. [2025-03-08 16:56:25,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 422 transitions. [2025-03-08 16:56:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:56:25,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:25,656 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:25,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:56:25,656 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:25,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:25,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1835693820, now seen corresponding path program 1 times [2025-03-08 16:56:25,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:25,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747431545] [2025-03-08 16:56:25,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:25,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:25,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:56:25,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:56:25,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:25,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747431545] [2025-03-08 16:56:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747431545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:26,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:56:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933515641] [2025-03-08 16:56:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:26,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:56:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:26,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:56:26,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:56:26,929 INFO L87 Difference]: Start difference. First operand 328 states and 422 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:27,600 INFO L93 Difference]: Finished difference Result 772 states and 993 transitions. [2025-03-08 16:56:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:56:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-08 16:56:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:27,602 INFO L225 Difference]: With dead ends: 772 [2025-03-08 16:56:27,602 INFO L226 Difference]: Without dead ends: 447 [2025-03-08 16:56:27,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:56:27,604 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 207 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:27,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1261 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:56:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-08 16:56:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2025-03-08 16:56:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 360 states have (on average 1.2416666666666667) internal successors, (447), 361 states have internal predecessors, (447), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 16:56:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2025-03-08 16:56:27,632 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 190 [2025-03-08 16:56:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:27,632 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2025-03-08 16:56:27,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2025-03-08 16:56:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:56:27,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:27,634 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:27,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:56:27,634 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:27,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash -496252068, now seen corresponding path program 1 times [2025-03-08 16:56:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363552124] [2025-03-08 16:56:27,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:27,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:27,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:56:27,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:56:27,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:27,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363552124] [2025-03-08 16:56:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363552124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:56:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476243266] [2025-03-08 16:56:28,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:28,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:56:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:28,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:56:28,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:56:28,846 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand has 13 states, 12 states have (on average 6.5) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:29,420 INFO L93 Difference]: Finished difference Result 862 states and 1106 transitions. [2025-03-08 16:56:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:56:29,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.5) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-08 16:56:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:29,422 INFO L225 Difference]: With dead ends: 862 [2025-03-08 16:56:29,422 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 16:56:29,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:56:29,423 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 167 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:29,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 962 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:56:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 16:56:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 364. [2025-03-08 16:56:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 337 states have (on average 1.2373887240356083) internal successors, (417), 337 states have internal predecessors, (417), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:56:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 463 transitions. [2025-03-08 16:56:29,440 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 463 transitions. Word has length 190 [2025-03-08 16:56:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:29,441 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 463 transitions. [2025-03-08 16:56:29,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.5) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 463 transitions. [2025-03-08 16:56:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:56:29,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:29,442 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:29,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:56:29,442 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:29,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash -367169349, now seen corresponding path program 1 times [2025-03-08 16:56:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:29,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058346583] [2025-03-08 16:56:29,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:29,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:29,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:56:29,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:56:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:30,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058346583] [2025-03-08 16:56:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058346583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:56:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252268935] [2025-03-08 16:56:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:30,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:56:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:30,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:56:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:56:30,322 INFO L87 Difference]: Start difference. First operand 364 states and 463 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:30,630 INFO L93 Difference]: Finished difference Result 784 states and 998 transitions. [2025-03-08 16:56:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:56:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-08 16:56:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:30,632 INFO L225 Difference]: With dead ends: 784 [2025-03-08 16:56:30,632 INFO L226 Difference]: Without dead ends: 423 [2025-03-08 16:56:30,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:56:30,633 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 147 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:30,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1026 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-08 16:56:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2025-03-08 16:56:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 382 states have (on average 1.2356020942408377) internal successors, (472), 383 states have internal predecessors, (472), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 16:56:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 530 transitions. [2025-03-08 16:56:30,652 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 530 transitions. Word has length 190 [2025-03-08 16:56:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:30,653 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 530 transitions. [2025-03-08 16:56:30,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 530 transitions. [2025-03-08 16:56:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:56:30,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:30,654 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:30,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:56:30,654 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1140382460, now seen corresponding path program 1 times [2025-03-08 16:56:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:30,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669785257] [2025-03-08 16:56:30,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:30,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:56:30,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:56:30,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:30,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669785257] [2025-03-08 16:56:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669785257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:31,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:31,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064122074] [2025-03-08 16:56:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:31,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:31,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:31,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:31,461 INFO L87 Difference]: Start difference. First operand 417 states and 530 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:31,724 INFO L93 Difference]: Finished difference Result 1104 states and 1398 transitions. [2025-03-08 16:56:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-08 16:56:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:31,727 INFO L225 Difference]: With dead ends: 1104 [2025-03-08 16:56:31,727 INFO L226 Difference]: Without dead ends: 690 [2025-03-08 16:56:31,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-08 16:56:31,728 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 73 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:31,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 643 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-08 16:56:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 672. [2025-03-08 16:56:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 625 states have (on average 1.24) internal successors, (775), 628 states have internal predecessors, (775), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 16:56:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 849 transitions. [2025-03-08 16:56:31,758 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 849 transitions. Word has length 190 [2025-03-08 16:56:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:31,758 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 849 transitions. [2025-03-08 16:56:31,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 849 transitions. [2025-03-08 16:56:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:56:31,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:31,759 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:31,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 16:56:31,759 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:31,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 913010237, now seen corresponding path program 1 times [2025-03-08 16:56:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670770171] [2025-03-08 16:56:31,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:31,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:56:31,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:56:31,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:31,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:32,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670770171] [2025-03-08 16:56:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670770171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:56:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213284051] [2025-03-08 16:56:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:32,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:56:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:32,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:56:32,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:56:32,680 INFO L87 Difference]: Start difference. First operand 672 states and 849 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:33,075 INFO L93 Difference]: Finished difference Result 1354 states and 1708 transitions. [2025-03-08 16:56:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:56:33,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-08 16:56:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:33,077 INFO L225 Difference]: With dead ends: 1354 [2025-03-08 16:56:33,077 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 16:56:33,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:56:33,078 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 71 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:33,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1346 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 16:56:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 675. [2025-03-08 16:56:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 625 states have (on average 1.232) internal successors, (770), 628 states have internal predecessors, (770), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 16:56:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 848 transitions. [2025-03-08 16:56:33,120 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 848 transitions. Word has length 190 [2025-03-08 16:56:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:33,120 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 848 transitions. [2025-03-08 16:56:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 848 transitions. [2025-03-08 16:56:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:56:33,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:33,122 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:33,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 16:56:33,122 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1264455707, now seen corresponding path program 1 times [2025-03-08 16:56:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603684214] [2025-03-08 16:56:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:33,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:56:33,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:56:33,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:33,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603684214] [2025-03-08 16:56:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603684214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:33,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:33,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:56:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543507046] [2025-03-08 16:56:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:33,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:56:33,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:33,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:56:33,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:56:33,209 INFO L87 Difference]: Start difference. First operand 675 states and 848 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:33,248 INFO L93 Difference]: Finished difference Result 1196 states and 1505 transitions. [2025-03-08 16:56:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:56:33,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:56:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:33,250 INFO L225 Difference]: With dead ends: 1196 [2025-03-08 16:56:33,250 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 16:56:33,250 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-08 16:56:33,251 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:33,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 669 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:56:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 16:56:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 476. [2025-03-08 16:56:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 440 states have (on average 1.2272727272727273) internal successors, (540), 441 states have internal predecessors, (540), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 16:56:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 598 transitions. [2025-03-08 16:56:33,272 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 598 transitions. Word has length 190 [2025-03-08 16:56:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:33,272 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 598 transitions. [2025-03-08 16:56:33,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 598 transitions. [2025-03-08 16:56:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:56:33,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:33,273 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:33,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 16:56:33,273 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:33,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:33,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1037083484, now seen corresponding path program 1 times [2025-03-08 16:56:33,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:33,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945616588] [2025-03-08 16:56:33,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:33,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:33,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:56:33,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:56:33,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:33,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945616588] [2025-03-08 16:56:34,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945616588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:34,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:34,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479381897] [2025-03-08 16:56:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:34,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:34,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:34,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:34,030 INFO L87 Difference]: Start difference. First operand 476 states and 598 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:34,238 INFO L93 Difference]: Finished difference Result 988 states and 1240 transitions. [2025-03-08 16:56:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:34,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-08 16:56:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:34,240 INFO L225 Difference]: With dead ends: 988 [2025-03-08 16:56:34,240 INFO L226 Difference]: Without dead ends: 515 [2025-03-08 16:56:34,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-08 16:56:34,240 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 125 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:34,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 668 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-08 16:56:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2025-03-08 16:56:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 470 states have (on average 1.225531914893617) internal successors, (576), 472 states have internal predecessors, (576), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 16:56:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 642 transitions. [2025-03-08 16:56:34,265 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 642 transitions. Word has length 190 [2025-03-08 16:56:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:34,265 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 642 transitions. [2025-03-08 16:56:34,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 642 transitions. [2025-03-08 16:56:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:56:34,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:34,267 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:34,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 16:56:34,267 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:34,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash 710212122, now seen corresponding path program 1 times [2025-03-08 16:56:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:34,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107098968] [2025-03-08 16:56:34,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:34,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:56:34,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:56:34,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:34,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107098968] [2025-03-08 16:56:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107098968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:35,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:35,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:56:35,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598170596] [2025-03-08 16:56:35,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:35,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:56:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:35,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:56:35,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:56:35,138 INFO L87 Difference]: Start difference. First operand 512 states and 642 transitions. Second operand has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:35,686 INFO L93 Difference]: Finished difference Result 1367 states and 1731 transitions. [2025-03-08 16:56:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:56:35,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-03-08 16:56:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:35,689 INFO L225 Difference]: With dead ends: 1367 [2025-03-08 16:56:35,689 INFO L226 Difference]: Without dead ends: 858 [2025-03-08 16:56:35,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:56:35,692 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 252 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:35,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1046 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:56:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-08 16:56:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 705. [2025-03-08 16:56:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 643 states have (on average 1.2006220839813375) internal successors, (772), 647 states have internal predecessors, (772), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 16:56:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 866 transitions. [2025-03-08 16:56:35,730 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 866 transitions. Word has length 191 [2025-03-08 16:56:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:35,731 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 866 transitions. [2025-03-08 16:56:35,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 866 transitions. [2025-03-08 16:56:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:56:35,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:35,732 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:35,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 16:56:35,732 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1182323404, now seen corresponding path program 1 times [2025-03-08 16:56:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911991658] [2025-03-08 16:56:35,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:35,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:56:35,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:56:35,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:35,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:36,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911991658] [2025-03-08 16:56:36,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911991658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:36,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:36,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:56:36,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638280309] [2025-03-08 16:56:36,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:36,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:56:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:36,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:56:36,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:56:36,676 INFO L87 Difference]: Start difference. First operand 705 states and 866 transitions. Second operand has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:56:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:37,311 INFO L93 Difference]: Finished difference Result 2049 states and 2507 transitions. [2025-03-08 16:56:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:56:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2025-03-08 16:56:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:37,314 INFO L225 Difference]: With dead ends: 2049 [2025-03-08 16:56:37,314 INFO L226 Difference]: Without dead ends: 1347 [2025-03-08 16:56:37,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:56:37,315 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 207 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:37,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1005 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:56:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-03-08 16:56:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1314. [2025-03-08 16:56:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1200 states have (on average 1.1858333333333333) internal successors, (1423), 1209 states have internal predecessors, (1423), 85 states have call successors, (85), 28 states have call predecessors, (85), 28 states have return successors, (85), 76 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 16:56:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1593 transitions. [2025-03-08 16:56:37,387 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1593 transitions. Word has length 191 [2025-03-08 16:56:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:37,387 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1593 transitions. [2025-03-08 16:56:37,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:56:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1593 transitions. [2025-03-08 16:56:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:56:37,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:37,389 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:37,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 16:56:37,389 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:37,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1479839893, now seen corresponding path program 1 times [2025-03-08 16:56:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55069890] [2025-03-08 16:56:37,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:37,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:56:37,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:56:37,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:37,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55069890] [2025-03-08 16:56:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55069890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:38,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:38,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:56:38,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446789778] [2025-03-08 16:56:38,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:38,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:56:38,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:38,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:56:38,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:56:38,112 INFO L87 Difference]: Start difference. First operand 1314 states and 1593 transitions. Second operand has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:56:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:38,518 INFO L93 Difference]: Finished difference Result 3293 states and 3996 transitions. [2025-03-08 16:56:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:56:38,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2025-03-08 16:56:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:38,523 INFO L225 Difference]: With dead ends: 3293 [2025-03-08 16:56:38,523 INFO L226 Difference]: Without dead ends: 1982 [2025-03-08 16:56:38,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:56:38,525 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 83 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:38,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 970 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-03-08 16:56:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1969. [2025-03-08 16:56:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1805 states have (on average 1.1839335180055401) internal successors, (2137), 1819 states have internal predecessors, (2137), 121 states have call successors, (121), 42 states have call predecessors, (121), 42 states have return successors, (121), 107 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-08 16:56:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2379 transitions. [2025-03-08 16:56:38,656 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2379 transitions. Word has length 191 [2025-03-08 16:56:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:38,656 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2379 transitions. [2025-03-08 16:56:38,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:56:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2379 transitions. [2025-03-08 16:56:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:56:38,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:38,659 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:38,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 16:56:38,659 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:38,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1676353398, now seen corresponding path program 1 times [2025-03-08 16:56:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:38,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581263454] [2025-03-08 16:56:38,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:38,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:56:38,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:56:38,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:38,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:39,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581263454] [2025-03-08 16:56:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581263454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:39,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:56:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820608894] [2025-03-08 16:56:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:39,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:56:39,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:39,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:56:39,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:56:39,146 INFO L87 Difference]: Start difference. First operand 1969 states and 2379 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:39,611 INFO L93 Difference]: Finished difference Result 4733 states and 5727 transitions. [2025-03-08 16:56:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:56:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2025-03-08 16:56:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:39,619 INFO L225 Difference]: With dead ends: 4733 [2025-03-08 16:56:39,619 INFO L226 Difference]: Without dead ends: 2767 [2025-03-08 16:56:39,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:56:39,622 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 136 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:39,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1822 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2025-03-08 16:56:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2414. [2025-03-08 16:56:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2238 states have (on average 1.174709562109026) internal successors, (2629), 2253 states have internal predecessors, (2629), 129 states have call successors, (129), 46 states have call predecessors, (129), 46 states have return successors, (129), 114 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-08 16:56:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2887 transitions. [2025-03-08 16:56:39,761 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2887 transitions. Word has length 191 [2025-03-08 16:56:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:39,761 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 2887 transitions. [2025-03-08 16:56:39,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2887 transitions. [2025-03-08 16:56:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:56:39,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:39,763 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:39,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 16:56:39,763 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:39,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -18259894, now seen corresponding path program 1 times [2025-03-08 16:56:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:39,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187474265] [2025-03-08 16:56:39,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:39,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:56:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:56:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187474265] [2025-03-08 16:56:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187474265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:40,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:40,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088932113] [2025-03-08 16:56:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:40,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:40,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:40,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:40,395 INFO L87 Difference]: Start difference. First operand 2414 states and 2887 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:40,762 INFO L93 Difference]: Finished difference Result 6000 states and 7159 transitions. [2025-03-08 16:56:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:56:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-03-08 16:56:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:40,770 INFO L225 Difference]: With dead ends: 6000 [2025-03-08 16:56:40,771 INFO L226 Difference]: Without dead ends: 3622 [2025-03-08 16:56:40,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-08 16:56:40,774 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 138 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:40,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 593 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-08 16:56:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3612. [2025-03-08 16:56:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3612 states, 3337 states have (on average 1.1657177105184298) internal successors, (3890), 3362 states have internal predecessors, (3890), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-08 16:56:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 4288 transitions. [2025-03-08 16:56:40,957 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 4288 transitions. Word has length 191 [2025-03-08 16:56:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:40,958 INFO L471 AbstractCegarLoop]: Abstraction has 3612 states and 4288 transitions. [2025-03-08 16:56:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 4288 transitions. [2025-03-08 16:56:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 16:56:40,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:40,961 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:40,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 16:56:40,961 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:40,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 247476033, now seen corresponding path program 1 times [2025-03-08 16:56:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:40,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812772159] [2025-03-08 16:56:40,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:40,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 16:56:41,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 16:56:41,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:41,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:42,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:42,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812772159] [2025-03-08 16:56:42,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812772159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:42,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:42,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:56:42,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498280370] [2025-03-08 16:56:42,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:42,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:56:42,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:42,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:56:42,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:56:42,031 INFO L87 Difference]: Start difference. First operand 3612 states and 4288 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:43,262 INFO L93 Difference]: Finished difference Result 10306 states and 12176 transitions. [2025-03-08 16:56:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:56:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-03-08 16:56:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:43,275 INFO L225 Difference]: With dead ends: 10306 [2025-03-08 16:56:43,275 INFO L226 Difference]: Without dead ends: 6738 [2025-03-08 16:56:43,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:56:43,279 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 337 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:43,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1586 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:56:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2025-03-08 16:56:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 3756. [2025-03-08 16:56:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3756 states, 3481 states have (on average 1.1657569663889686) internal successors, (4058), 3506 states have internal predecessors, (4058), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-08 16:56:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3756 states to 3756 states and 4456 transitions. [2025-03-08 16:56:43,481 INFO L78 Accepts]: Start accepts. Automaton has 3756 states and 4456 transitions. Word has length 192 [2025-03-08 16:56:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:43,482 INFO L471 AbstractCegarLoop]: Abstraction has 3756 states and 4456 transitions. [2025-03-08 16:56:43,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3756 states and 4456 transitions. [2025-03-08 16:56:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 16:56:43,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:43,485 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:43,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 16:56:43,485 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:43,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1762627808, now seen corresponding path program 1 times [2025-03-08 16:56:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227665330] [2025-03-08 16:56:43,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:43,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:43,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 16:56:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 16:56:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227665330] [2025-03-08 16:56:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227665330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913835256] [2025-03-08 16:56:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:44,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:44,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:44,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:44,278 INFO L87 Difference]: Start difference. First operand 3756 states and 4456 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:44,690 INFO L93 Difference]: Finished difference Result 7212 states and 8567 transitions. [2025-03-08 16:56:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-03-08 16:56:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:44,696 INFO L225 Difference]: With dead ends: 7212 [2025-03-08 16:56:44,696 INFO L226 Difference]: Without dead ends: 3500 [2025-03-08 16:56:44,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-08 16:56:44,700 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 85 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:44,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 701 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2025-03-08 16:56:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3498. [2025-03-08 16:56:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3223 states have (on average 1.1594787465094631) internal successors, (3737), 3248 states have internal predecessors, (3737), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-08 16:56:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4135 transitions. [2025-03-08 16:56:44,885 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4135 transitions. Word has length 192 [2025-03-08 16:56:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 4135 transitions. [2025-03-08 16:56:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4135 transitions. [2025-03-08 16:56:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:56:44,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:44,889 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:44,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 16:56:44,889 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:44,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1228776206, now seen corresponding path program 1 times [2025-03-08 16:56:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:44,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233877341] [2025-03-08 16:56:44,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:44,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:56:44,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:56:44,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233877341] [2025-03-08 16:56:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233877341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:45,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:45,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:56:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636631058] [2025-03-08 16:56:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:45,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:56:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:45,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:56:45,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:56:45,821 INFO L87 Difference]: Start difference. First operand 3498 states and 4135 transitions. Second operand has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:56:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:46,487 INFO L93 Difference]: Finished difference Result 8116 states and 9577 transitions. [2025-03-08 16:56:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:56:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2025-03-08 16:56:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:46,494 INFO L225 Difference]: With dead ends: 8116 [2025-03-08 16:56:46,495 INFO L226 Difference]: Without dead ends: 4662 [2025-03-08 16:56:46,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:56:46,499 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 211 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:46,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1286 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:56:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2025-03-08 16:56:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 3872. [2025-03-08 16:56:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3872 states, 3594 states have (on average 1.1552587646076795) internal successors, (4152), 3619 states have internal predecessors, (4152), 201 states have call successors, (201), 76 states have call predecessors, (201), 76 states have return successors, (201), 176 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-08 16:56:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 4554 transitions. [2025-03-08 16:56:46,702 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 4554 transitions. Word has length 193 [2025-03-08 16:56:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:46,702 INFO L471 AbstractCegarLoop]: Abstraction has 3872 states and 4554 transitions. [2025-03-08 16:56:46,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:56:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 4554 transitions. [2025-03-08 16:56:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:56:46,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:46,705 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:46,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 16:56:46,705 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1032262701, now seen corresponding path program 1 times [2025-03-08 16:56:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193498377] [2025-03-08 16:56:46,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:46,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:46,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:56:46,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:56:46,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:46,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193498377] [2025-03-08 16:56:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193498377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:47,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:56:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479319359] [2025-03-08 16:56:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:47,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:56:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:47,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:56:47,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:56:47,337 INFO L87 Difference]: Start difference. First operand 3872 states and 4554 transitions. Second operand has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:47,921 INFO L93 Difference]: Finished difference Result 8276 states and 9724 transitions. [2025-03-08 16:56:47,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:56:47,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-03-08 16:56:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:47,929 INFO L225 Difference]: With dead ends: 8276 [2025-03-08 16:56:47,929 INFO L226 Difference]: Without dead ends: 4448 [2025-03-08 16:56:47,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:56:47,933 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 81 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:47,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 837 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2025-03-08 16:56:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4207. [2025-03-08 16:56:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4207 states, 3928 states have (on average 1.1494399185336048) internal successors, (4515), 3953 states have internal predecessors, (4515), 201 states have call successors, (201), 77 states have call predecessors, (201), 77 states have return successors, (201), 176 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-08 16:56:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 4917 transitions. [2025-03-08 16:56:48,229 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 4917 transitions. Word has length 193 [2025-03-08 16:56:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:48,229 INFO L471 AbstractCegarLoop]: Abstraction has 4207 states and 4917 transitions. [2025-03-08 16:56:48,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 4917 transitions. [2025-03-08 16:56:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:56:48,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:48,233 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 16:56:48,233 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:48,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1161345420, now seen corresponding path program 1 times [2025-03-08 16:56:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012128587] [2025-03-08 16:56:48,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:48,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:56:48,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:56:48,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:48,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:48,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:48,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012128587] [2025-03-08 16:56:48,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012128587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927143376] [2025-03-08 16:56:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:48,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:48,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:48,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:48,882 INFO L87 Difference]: Start difference. First operand 4207 states and 4917 transitions. Second operand has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:49,275 INFO L93 Difference]: Finished difference Result 8357 states and 9764 transitions. [2025-03-08 16:56:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-03-08 16:56:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:49,286 INFO L225 Difference]: With dead ends: 8357 [2025-03-08 16:56:49,286 INFO L226 Difference]: Without dead ends: 4194 [2025-03-08 16:56:49,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-08 16:56:49,291 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 129 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:49,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 495 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:56:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2025-03-08 16:56:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 3617. [2025-03-08 16:56:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3387 states have (on average 1.1455565397106584) internal successors, (3880), 3407 states have internal predecessors, (3880), 165 states have call successors, (165), 64 states have call predecessors, (165), 64 states have return successors, (165), 145 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-08 16:56:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 4210 transitions. [2025-03-08 16:56:49,474 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 4210 transitions. Word has length 193 [2025-03-08 16:56:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:49,474 INFO L471 AbstractCegarLoop]: Abstraction has 3617 states and 4210 transitions. [2025-03-08 16:56:49,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:56:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 4210 transitions. [2025-03-08 16:56:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:56:49,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:49,477 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:49,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 16:56:49,477 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -531147098, now seen corresponding path program 1 times [2025-03-08 16:56:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084055994] [2025-03-08 16:56:49,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:49,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:56:49,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:56:49,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084055994] [2025-03-08 16:56:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084055994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:56:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993154844] [2025-03-08 16:56:49,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:49,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:49,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:56:49,961 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-08 16:56:49,962 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-08 16:56:50,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:56:50,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:56:50,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:50,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:50,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 16:56:50,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:50,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:50,464 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 50 treesize of output 36 [2025-03-08 16:56:50,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2025-03-08 16:56:50,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2025-03-08 16:56:50,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:50,517 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 63 treesize of output 38 [2025-03-08 16:56:50,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:50,526 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 63 treesize of output 38 [2025-03-08 16:56:50,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:50,553 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 63 treesize of output 38 [2025-03-08 16:56:50,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:50,577 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 59 treesize of output 38 [2025-03-08 16:56:50,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:50,640 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 73 treesize of output 37 [2025-03-08 16:56:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-03-08 16:56:50,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:56:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:50,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993154844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:56:50,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:56:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-03-08 16:56:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871350078] [2025-03-08 16:56:50,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:56:50,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:56:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:50,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:56:50,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:56:50,990 INFO L87 Difference]: Start difference. First operand 3617 states and 4210 transitions. Second operand has 15 states, 12 states have (on average 13.833333333333334) internal successors, (166), 15 states have internal predecessors, (166), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-08 16:56:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:52,035 INFO L93 Difference]: Finished difference Result 6827 states and 7936 transitions. [2025-03-08 16:56:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 16:56:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 13.833333333333334) internal successors, (166), 15 states have internal predecessors, (166), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) Word has length 193 [2025-03-08 16:56:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:52,041 INFO L225 Difference]: With dead ends: 6827 [2025-03-08 16:56:52,041 INFO L226 Difference]: Without dead ends: 2868 [2025-03-08 16:56:52,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 372 SyntacticMatches, 16 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 16:56:52,046 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 230 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:52,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 603 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:56:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2025-03-08 16:56:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 1835. [2025-03-08 16:56:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1696 states have (on average 1.1527122641509433) internal successors, (1955), 1704 states have internal predecessors, (1955), 99 states have call successors, (99), 39 states have call predecessors, (99), 39 states have return successors, (99), 91 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 16:56:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2153 transitions. [2025-03-08 16:56:52,199 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2153 transitions. Word has length 193 [2025-03-08 16:56:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:52,199 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2153 transitions. [2025-03-08 16:56:52,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 13.833333333333334) internal successors, (166), 15 states have internal predecessors, (166), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-08 16:56:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2153 transitions. [2025-03-08 16:56:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 16:56:52,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:52,202 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:52,210 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-08 16:56:52,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-08 16:56:52,402 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:52,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 769336083, now seen corresponding path program 1 times [2025-03-08 16:56:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652401482] [2025-03-08 16:56:52,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:52,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:56:52,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:56:52,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:52,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:52,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652401482] [2025-03-08 16:56:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652401482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:56:52,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439087763] [2025-03-08 16:56:52,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:52,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:52,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:56:52,968 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-08 16:56:52,969 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-08 16:56:53,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:56:53,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:56:53,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:53,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:53,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 16:56:53,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:53,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:53,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:53,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:53,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:53,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:53,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:53,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:56:53,399 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 25 treesize of output 24 [2025-03-08 16:56:53,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:53,422 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-08 16:56:53,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:53,428 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-08 16:56:53,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:53,436 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 40 treesize of output 45 [2025-03-08 16:56:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 16:56:53,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:56:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439087763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:56:53,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:56:53,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2025-03-08 16:56:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221648218] [2025-03-08 16:56:53,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:56:53,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:56:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:53,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:56:53,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:56:53,725 INFO L87 Difference]: Start difference. First operand 1835 states and 2153 transitions. Second operand has 21 states, 17 states have (on average 8.294117647058824) internal successors, (141), 21 states have internal predecessors, (141), 7 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 7 states have call successors, (51) [2025-03-08 16:56:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:55,445 INFO L93 Difference]: Finished difference Result 3680 states and 4305 transitions. [2025-03-08 16:56:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-08 16:56:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.294117647058824) internal successors, (141), 21 states have internal predecessors, (141), 7 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 7 states have call successors, (51) Word has length 196 [2025-03-08 16:56:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:55,449 INFO L225 Difference]: With dead ends: 3680 [2025-03-08 16:56:55,449 INFO L226 Difference]: Without dead ends: 1901 [2025-03-08 16:56:55,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 385 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=814, Invalid=4736, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 16:56:55,452 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 490 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:55,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 888 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:56:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-08 16:56:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1568. [2025-03-08 16:56:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1382 states have (on average 1.1374819102749638) internal successors, (1572), 1391 states have internal predecessors, (1572), 130 states have call successors, (130), 55 states have call predecessors, (130), 55 states have return successors, (130), 121 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 16:56:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1832 transitions. [2025-03-08 16:56:55,603 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1832 transitions. Word has length 196 [2025-03-08 16:56:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:55,603 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 1832 transitions. [2025-03-08 16:56:55,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.294117647058824) internal successors, (141), 21 states have internal predecessors, (141), 7 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 7 states have call successors, (51) [2025-03-08 16:56:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1832 transitions. [2025-03-08 16:56:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 16:56:55,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:55,606 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:55,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 16:56:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:55,810 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -116401034, now seen corresponding path program 1 times [2025-03-08 16:56:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806919340] [2025-03-08 16:56:55,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:55,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:56:55,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:56:55,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:55,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806919340] [2025-03-08 16:56:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806919340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:56:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419833371] [2025-03-08 16:56:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:56:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:55,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:56:55,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:55,867 INFO L87 Difference]: Start difference. First operand 1568 states and 1832 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:56,005 INFO L93 Difference]: Finished difference Result 2848 states and 3337 transitions. [2025-03-08 16:56:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:56:56,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-08 16:56:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:56,009 INFO L225 Difference]: With dead ends: 2848 [2025-03-08 16:56:56,009 INFO L226 Difference]: Without dead ends: 1340 [2025-03-08 16:56:56,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:56,010 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:56,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 495 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:56:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-03-08 16:56:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2025-03-08 16:56:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1154 states have (on average 1.1317157712305026) internal successors, (1306), 1163 states have internal predecessors, (1306), 130 states have call successors, (130), 55 states have call predecessors, (130), 55 states have return successors, (130), 121 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 16:56:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1566 transitions. [2025-03-08 16:56:56,147 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1566 transitions. Word has length 196 [2025-03-08 16:56:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:56,148 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1566 transitions. [2025-03-08 16:56:56,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1566 transitions. [2025-03-08 16:56:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 16:56:56,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:56,149 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:56,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 16:56:56,149 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:56,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1191372755, now seen corresponding path program 1 times [2025-03-08 16:56:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:56,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682729277] [2025-03-08 16:56:56,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:56,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:56:56,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:56:56,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:56,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682729277] [2025-03-08 16:56:56,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682729277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:56:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393653323] [2025-03-08 16:56:56,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:56,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:56,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:56:56,628 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-08 16:56:56,630 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-08 16:56:56,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:56:56,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:56:56,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:56,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:56,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 16:56:56,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:56,896 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 33 treesize of output 17 [2025-03-08 16:56:56,915 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 33 treesize of output 17 [2025-03-08 16:56:56,932 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 33 treesize of output 17 [2025-03-08 16:56:56,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 33 treesize of output 17 [2025-03-08 16:56:56,968 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 33 treesize of output 17 [2025-03-08 16:56:56,999 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 33 treesize of output 17 [2025-03-08 16:56:57,013 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 52 treesize of output 38 [2025-03-08 16:56:57,015 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 56 treesize of output 48 [2025-03-08 16:56:57,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2025-03-08 16:56:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 522 proven. 36 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-08 16:56:57,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:56:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:56:57,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393653323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:56:57,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:56:57,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-08 16:56:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586345781] [2025-03-08 16:56:57,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:56:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:56:57,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:57,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:56:57,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:56:57,232 INFO L87 Difference]: Start difference. First operand 1340 states and 1566 transitions. Second operand has 10 states, 8 states have (on average 11.75) internal successors, (94), 10 states have internal predecessors, (94), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 16:56:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:57,640 INFO L93 Difference]: Finished difference Result 1904 states and 2214 transitions. [2025-03-08 16:56:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:56:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 11.75) internal successors, (94), 10 states have internal predecessors, (94), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 196 [2025-03-08 16:56:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:57,642 INFO L225 Difference]: With dead ends: 1904 [2025-03-08 16:56:57,642 INFO L226 Difference]: Without dead ends: 624 [2025-03-08 16:56:57,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 389 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:56:57,645 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 240 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:57,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 347 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:56:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-08 16:56:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 566. [2025-03-08 16:56:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 476 states have (on average 1.1092436974789917) internal successors, (528), 479 states have internal predecessors, (528), 58 states have call successors, (58), 31 states have call predecessors, (58), 31 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:56:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 644 transitions. [2025-03-08 16:56:57,716 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 644 transitions. Word has length 196 [2025-03-08 16:56:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:57,716 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 644 transitions. [2025-03-08 16:56:57,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 11.75) internal successors, (94), 10 states have internal predecessors, (94), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 16:56:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 644 transitions. [2025-03-08 16:56:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 16:56:57,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:57,717 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:57,725 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-08 16:56:57,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:56:57,918 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:57,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash -987599791, now seen corresponding path program 1 times [2025-03-08 16:56:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:57,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983537] [2025-03-08 16:56:57,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:57,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 16:56:57,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 16:56:57,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:57,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:56:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:56:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983537] [2025-03-08 16:56:58,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:58,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:58,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:56:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440828791] [2025-03-08 16:56:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:58,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:56:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:56:58,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:56:58,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:56:58,284 INFO L87 Difference]: Start difference. First operand 566 states and 644 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:58,496 INFO L93 Difference]: Finished difference Result 1068 states and 1218 transitions. [2025-03-08 16:56:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:56:58,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 198 [2025-03-08 16:56:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:58,498 INFO L225 Difference]: With dead ends: 1068 [2025-03-08 16:56:58,498 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 16:56:58,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:56:58,499 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 113 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:58,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 224 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:56:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 16:56:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-08 16:56:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 476 states have (on average 1.1029411764705883) internal successors, (525), 479 states have internal predecessors, (525), 58 states have call successors, (58), 31 states have call predecessors, (58), 31 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:56:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 641 transitions. [2025-03-08 16:56:58,580 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 641 transitions. Word has length 198 [2025-03-08 16:56:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:58,580 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 641 transitions. [2025-03-08 16:56:58,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:56:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 641 transitions. [2025-03-08 16:56:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:56:58,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:58,581 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:58,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 16:56:58,581 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:58,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2080388269, now seen corresponding path program 1 times [2025-03-08 16:56:58,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:56:58,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477623027] [2025-03-08 16:56:58,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:56:58,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:56:58,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:56:58,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:58,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:57:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:57:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:57:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477623027] [2025-03-08 16:57:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477623027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:57:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:57:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:57:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415385089] [2025-03-08 16:57:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:57:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:57:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:57:08,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:57:08,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:57:08,543 INFO L87 Difference]: Start difference. First operand 566 states and 641 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:57:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:57:09,452 INFO L93 Difference]: Finished difference Result 1492 states and 1687 transitions. [2025-03-08 16:57:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:57:09,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 200 [2025-03-08 16:57:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:57:09,455 INFO L225 Difference]: With dead ends: 1492 [2025-03-08 16:57:09,455 INFO L226 Difference]: Without dead ends: 990 [2025-03-08 16:57:09,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:57:09,456 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 190 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:57:09,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 878 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:57:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-08 16:57:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 949. [2025-03-08 16:57:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 812 states have (on average 1.0997536945812807) internal successors, (893), 818 states have internal predecessors, (893), 88 states have call successors, (88), 48 states have call predecessors, (88), 48 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 16:57:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1069 transitions. [2025-03-08 16:57:09,581 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1069 transitions. Word has length 200 [2025-03-08 16:57:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:57:09,581 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1069 transitions. [2025-03-08 16:57:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 16:57:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1069 transitions. [2025-03-08 16:57:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:57:09,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:57:09,582 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:57:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 16:57:09,582 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:57:09,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:57:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1956315022, now seen corresponding path program 1 times [2025-03-08 16:57:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:57:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118913008] [2025-03-08 16:57:09,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:57:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:57:09,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:57:09,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:57:09,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:57:09,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:57:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:57:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:57:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118913008] [2025-03-08 16:57:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118913008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:57:10,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:57:10,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:57:10,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394790553] [2025-03-08 16:57:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:57:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:57:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:57:10,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:57:10,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:57:10,028 INFO L87 Difference]: Start difference. First operand 949 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:57:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:57:10,368 INFO L93 Difference]: Finished difference Result 1849 states and 2082 transitions. [2025-03-08 16:57:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:57:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-08 16:57:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:57:10,370 INFO L225 Difference]: With dead ends: 1849 [2025-03-08 16:57:10,371 INFO L226 Difference]: Without dead ends: 964 [2025-03-08 16:57:10,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:57:10,372 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 75 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:57:10,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 641 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:57:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-08 16:57:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 768. [2025-03-08 16:57:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 687 states have (on average 1.1004366812227073) internal successors, (756), 690 states have internal predecessors, (756), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-08 16:57:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 862 transitions. [2025-03-08 16:57:10,450 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 862 transitions. Word has length 200 [2025-03-08 16:57:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:57:10,450 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 862 transitions. [2025-03-08 16:57:10,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:57:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 862 transitions. [2025-03-08 16:57:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:57:10,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:57:10,452 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:57:10,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 16:57:10,452 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:57:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:57:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 531197811, now seen corresponding path program 1 times [2025-03-08 16:57:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:57:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500332678] [2025-03-08 16:57:10,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:57:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:57:10,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:57:10,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:57:10,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:57:10,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat